Base | Representation |
---|---|
bin | 10111001100011110001011… |
… | …000011100011101101001011 |
3 | 111101012021001201201200201222 |
4 | 113030132023003203231023 |
5 | 101332331240402304003 |
6 | 1000543413510432255 |
7 | 30326062652230562 |
oct | 2714361303435513 |
9 | 441167051650658 |
10 | 102012101213003 |
11 | 2a5600a8759443 |
12 | b53676636268b |
13 | 44bc9137bb787 |
14 | 1b295aa908bd9 |
15 | bbd87ed61c38 |
hex | 5cc78b0e3b4b |
102012101213003 has 8 divisors (see below), whose sum is σ = 108032767481088. Its totient is φ = 95993652104064.
The previous prime is 102012101212999. The next prime is 102012101213069. The reversal of 102012101213003 is 300312101210201.
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 102012101213003 - 22 = 102012101212999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102012101213203) 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, 554195051 + ... + 554379092.
It is an arithmetic number, because the mean of its divisors is an integer number (13504095935136).
Almost surely, 2102012101213003 is an apocalyptic number.
102012101213003 is a deficient number, since it is larger than the sum of its proper divisors (6020666268085).
102012101213003 is a wasteful number, since it uses less digits than its factorization.
102012101213003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108579573.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102012101213003 its reverse (300312101210201), we get a palindrome (402324202423204).
The spelling of 102012101213003 in words is "one hundred two trillion, twelve billion, one hundred one million, two hundred thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •