Base | Representation |
---|---|
bin | 1001010010100011010010… |
… | …0011110110111001111111 |
3 | 1100011110221002220202201122 |
4 | 2110220310203312321333 |
5 | 2314322403343420210 |
6 | 33420220250501155 |
7 | 2102650136564141 |
oct | 224506443667177 |
9 | 40143832822648 |
10 | 10214314045055 |
11 | 3288958aa011a |
12 | 118b7291347bb |
13 | 591289b61133 |
14 | 2745382b4c91 |
15 | 12aa6ed80b55 |
hex | 94a348f6e7f |
10214314045055 has 8 divisors (see below), whose sum is σ = 12556132387344. Its totient is φ = 7972147547200.
The previous prime is 10214314045051. The next prime is 10214314045087. The reversal of 10214314045055 is 55054041341201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10214314045055 - 22 = 10214314045051 is a prime.
It is a super-2 number, since 2×102143140450552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10214314045051) 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, 24912960881 + ... + 24912961290.
It is an arithmetic number, because the mean of its divisors is an integer number (1569516548418).
Almost surely, 210214314045055 is an apocalyptic number.
10214314045055 is a deficient number, since it is larger than the sum of its proper divisors (2341818342289).
10214314045055 is an equidigital number, since it uses as much as digits as its factorization.
10214314045055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49825922217.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 10214314045055 its reverse (55054041341201), we get a palindrome (65268355386256).
The spelling of 10214314045055 in words is "ten trillion, two hundred fourteen billion, three hundred fourteen million, forty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •