Base | Representation |
---|---|
bin | 1001001101001011110011… |
… | …1001100000011011001010 |
3 | 1022211122221101202202002100 |
4 | 2103102330321200123022 |
5 | 2311320041202003002 |
6 | 33310011212014230 |
7 | 2063204242411221 |
oct | 223227471403312 |
9 | 38748841682070 |
10 | 10122112141002 |
11 | 3252844469a14 |
12 | 1175896a61376 |
13 | 585684ac1964 |
14 | 26dcacba1cb8 |
15 | 12847555d11c |
hex | 934bce606ca |
10122112141002 has 24 divisors (see below), whose sum is σ = 21931792308036. Its totient is φ = 3373952867136.
The previous prime is 10122112140983. The next prime is 10122112141003. The reversal of 10122112141002 is 20014121122101.
10122112141002 is a `hidden beast` number, since 10 + 1 + 221 + 1 + 21 + 410 + 0 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 9737264370681 + 384847770321 = 3120459^2 + 620361^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10122112141003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6302083 + ... + 7743414.
Almost surely, 210122112141002 is an apocalyptic number.
10122112141002 is an abundant number, since it is smaller than the sum of its proper divisors (11809680167034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122112141002 is a wasteful number, since it uses less digits than its factorization.
10122112141002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14085542 (or 14085539 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10122112141002 its reverse (20014121122101), we get a palindrome (30136233263103).
The spelling of 10122112141002 in words is "ten trillion, one hundred twenty-two billion, one hundred twelve million, one hundred forty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •