Base | Representation |
---|---|
bin | 1001001111000110010100… |
… | …1111010111100000101101 |
3 | 1022221210211111100210221220 |
4 | 2103301211033113200231 |
5 | 2312334420302340041 |
6 | 33333050531013553 |
7 | 2065450253053335 |
oct | 223614517274055 |
9 | 38853744323856 |
10 | 10155001215021 |
11 | 326579149a023 |
12 | 118013543a2b9 |
13 | 5887c68a05c0 |
14 | 27170cbba0c5 |
15 | 12924cb18d66 |
hex | 93c653d782d |
10155001215021 has 32 divisors (see below), whose sum is σ = 15378338250240. Its totient is φ = 5909004437184.
The previous prime is 10155001214993. The next prime is 10155001215119. The reversal of 10155001215021 is 12051210055101.
It is not a de Polignac number, because 10155001215021 - 211 = 10155001212973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10155001214982 and 10155001215000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10155001217021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12714231 + ... + 13489316.
It is an arithmetic number, because the mean of its divisors is an integer number (480573070320).
Almost surely, 210155001215021 is an apocalyptic number.
It is an amenable number.
10155001215021 is a deficient number, since it is larger than the sum of its proper divisors (5223337035219).
10155001215021 is a wasteful number, since it uses less digits than its factorization.
10155001215021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26204105.
The product of its (nonzero) digits is 500, while the sum is 24.
The spelling of 10155001215021 in words is "ten trillion, one hundred fifty-five billion, one million, two hundred fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •