Base | Representation |
---|---|
bin | 1001001001101100010001… |
… | …0000011101000111010011 |
3 | 1022121221001110201202002012 |
4 | 2102123010100131013103 |
5 | 2304324143122230443 |
6 | 33222245005213135 |
7 | 2055651240165353 |
oct | 222330420350723 |
9 | 38557043652065 |
10 | 10062106055123 |
11 | 322a351605501 |
12 | 116612ab611ab |
13 | 57cb11013675 |
14 | 26b0195a6b63 |
15 | 126b12507118 |
hex | 926c441d1d3 |
10062106055123 has 16 divisors (see below), whose sum is σ = 10596801085440. Its totient is φ = 9527923339200.
The previous prime is 10062106055107. The next prime is 10062106055153. The reversal of 10062106055123 is 32155060126001.
It is a cyclic number.
It is not a de Polignac number, because 10062106055123 - 24 = 10062106055107 is a prime.
It is a super-2 number, since 2×100621060551232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10062106055123.
It is not an unprimeable number, because it can be changed into a prime (10062106055153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 385345838 + ... + 385371948.
It is an arithmetic number, because the mean of its divisors is an integer number (662300067840).
Almost surely, 210062106055123 is an apocalyptic number.
10062106055123 is a deficient number, since it is larger than the sum of its proper divisors (534695030317).
10062106055123 is a wasteful number, since it uses less digits than its factorization.
10062106055123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35138.
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 10062106055123 in words is "ten trillion, sixty-two billion, one hundred six million, fifty-five thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •