Base | Representation |
---|---|
bin | 10111001110001110001000… |
… | …000100111000100000110100 |
3 | 111101121202100022100200112012 |
4 | 113032032020010320200310 |
5 | 101341313432420004022 |
6 | 1001114534032543352 |
7 | 30340546600561160 |
oct | 2716161004704064 |
9 | 441552308320465 |
10 | 102132310313012 |
11 | 2a5a7084651491 |
12 | b555b140b1b58 |
13 | 44cb0600c8155 |
14 | 1b31331921ca0 |
15 | bc1a6836cde2 |
hex | 5ce388138834 |
102132310313012 has 24 divisors (see below), whose sum is σ = 205141292830656. Its totient is φ = 43583131804608.
The previous prime is 102132310313003. The next prime is 102132310313017. The reversal of 102132310313012 is 210313013231201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102132310313017) 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 7 ways as a sum of consecutive naturals, for example, 7827423758 + ... + 7827436805.
It is an arithmetic number, because the mean of its divisors is an integer number (8547553867944).
Almost surely, 2102132310313012 is an apocalyptic number.
It is an amenable number.
102132310313012 is an abundant number, since it is smaller than the sum of its proper divisors (103008982517644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102132310313012 is a wasteful number, since it uses less digits than its factorization.
102132310313012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15654860807 (or 15654860805 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 102132310313012 its reverse (210313013231201), we get a palindrome (312445323544213).
The spelling of 102132310313012 in words is "one hundred two trillion, one hundred thirty-two billion, three hundred ten million, three hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •