Base | Representation |
---|---|
bin | 1001001001010011010010… |
… | …1011101111000100000111 |
3 | 1022121021202021110201111011 |
4 | 2102110310223233010013 |
5 | 2304221430443221020 |
6 | 33215215453023051 |
7 | 2055323146321444 |
oct | 222246453570407 |
9 | 38537667421434 |
10 | 10055402320135 |
11 | 3227521514157 |
12 | 1164979a84a87 |
13 | 57c2b31cb483 |
14 | 26a98112a9cb |
15 | 12686dc1035a |
hex | 92534aef107 |
10055402320135 has 8 divisors (see below), whose sum is σ = 12093969080160. Its totient is φ = 8025997658784.
The previous prime is 10055402320049. The next prime is 10055402320153. The reversal of 10055402320135 is 53102320455001.
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 10055402320135 - 239 = 9505646506247 is a prime.
It is a super-2 number, since 2×100554023201352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10055402320097 and 10055402320106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2290522252 + ... + 2290526641.
It is an arithmetic number, because the mean of its divisors is an integer number (1511746135020).
Almost surely, 210055402320135 is an apocalyptic number.
10055402320135 is a deficient number, since it is larger than the sum of its proper divisors (2038566760025).
10055402320135 is an equidigital number, since it uses as much as digits as its factorization.
10055402320135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4581049337.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 10055402320135 its reverse (53102320455001), we get a palindrome (63157722775136).
The spelling of 10055402320135 in words is "ten trillion, fifty-five billion, four hundred two million, three hundred twenty thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •