Base | Representation |
---|---|
bin | 111011101100101100100… |
… | …111001010001000101001 |
3 | 112112012010020211012100102 |
4 | 323230230213022020221 |
5 | 1014203300202332223 |
6 | 12420345210315145 |
7 | 602251225412450 |
oct | 73545447121051 |
9 | 15465106735312 |
10 | 4102442230313 |
11 | 1341921763529 |
12 | 5630b7728ab5 |
13 | 239b2158b86b |
14 | 1027b8893b97 |
15 | 71aa980d928 |
hex | 3bb2c9ca229 |
4102442230313 has 8 divisors (see below), whose sum is σ = 4802859196800. Its totient is φ = 3430613711520.
The previous prime is 4102442230217. The next prime is 4102442230421. The reversal of 4102442230313 is 3130322442014.
4102442230313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4102442230313 - 220 = 4102441181737 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4102442200313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7147111613 + ... + 7147112186.
It is an arithmetic number, because the mean of its divisors is an integer number (600357399600).
Almost surely, 24102442230313 is an apocalyptic number.
It is an amenable number.
4102442230313 is a deficient number, since it is larger than the sum of its proper divisors (700416966487).
4102442230313 is a wasteful number, since it uses less digits than its factorization.
4102442230313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14294223847.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 4102442230313 its reverse (3130322442014), we get a palindrome (7232764672327).
The spelling of 4102442230313 in words is "four trillion, one hundred two billion, four hundred forty-two million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •