Base | Representation |
---|---|
bin | 1001001110111111000100… |
… | …0000010100101001000111 |
3 | 1022221121210120220102100012 |
4 | 2103233301000110221013 |
5 | 2312321422041122210 |
6 | 33332125225340435 |
7 | 2065351033345643 |
oct | 223576100245107 |
9 | 38847716812305 |
10 | 10153051114055 |
11 | 3264980734333 |
12 | 117b89033771b |
13 | 5885758776c5 |
14 | 2715a5bcdc23 |
15 | 129186811305 |
hex | 93bf1014a47 |
10153051114055 has 8 divisors (see below), whose sum is σ = 12304291647744. Its totient is φ = 8042020684000.
The previous prime is 10153051114051. The next prime is 10153051114069. The reversal of 10153051114055 is 55041115035101.
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 10153051114055 - 22 = 10153051114051 is a prime.
It is a super-2 number, since 2×101530511140552 (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 (10153051114051) 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, 10052525351 + ... + 10052526360.
It is an arithmetic number, because the mean of its divisors is an integer number (1538036455968).
Almost surely, 210153051114055 is an apocalyptic number.
10153051114055 is a deficient number, since it is larger than the sum of its proper divisors (2151240533689).
10153051114055 is a wasteful number, since it uses less digits than its factorization.
10153051114055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20105051817.
The product of its (nonzero) digits is 7500, while the sum is 32.
Adding to 10153051114055 its reverse (55041115035101), we get a palindrome (65194166149156).
The spelling of 10153051114055 in words is "ten trillion, one hundred fifty-three billion, fifty-one million, one hundred fourteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •