Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …001101001100101101101110 |
3 | 111101012011020220110222121101 |
4 | 113030131022031030231232 |
5 | 101332322023341034410 |
6 | 1000543113523153314 |
7 | 30326024001400111 |
oct | 2714351215145556 |
9 | 441164226428541 |
10 | 102011013221230 |
11 | 2a55a69a5a6093 |
12 | b536501b1583a |
13 | 44bc79c283769 |
14 | 1b29506214578 |
15 | bbd81959dd3a |
hex | 5cc74a34cb6e |
102011013221230 has 16 divisors (see below), whose sum is σ = 185944125366720. Its totient is φ = 40287893828832.
The previous prime is 102011013221219. The next prime is 102011013221267. The reversal of 102011013221230 is 32122310110201.
It is a junction number, because it is equal to n+sod(n) for n = 102011013221198 and 102011013221207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64563931629 + ... + 64563933208.
It is an arithmetic number, because the mean of its divisors is an integer number (11621507835420).
Almost surely, 2102011013221230 is an apocalyptic number.
102011013221230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102011013221230 is a deficient number, since it is larger than the sum of its proper divisors (83933112145490).
102011013221230 is a wasteful number, since it uses less digits than its factorization.
102011013221230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129127864923.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 102011013221230 its reverse (32122310110201), we get a palindrome (134133323331431).
The spelling of 102011013221230 in words is "one hundred two trillion, eleven billion, thirteen million, two hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •