Base | Representation |
---|---|
bin | 10111001111010110100101… |
… | …010011111100100000100010 |
3 | 111101220012011022121001111022 |
4 | 113033112211103330200202 |
5 | 101344102301203242010 |
6 | 1001214402034445442 |
7 | 30346302546033404 |
oct | 2717264523744042 |
9 | 441805138531438 |
10 | 102210110212130 |
11 | 2a62707866a178 |
12 | b569007133882 |
13 | 45054ab49470b |
14 | 1b34dd23d4b74 |
15 | bc3abd5eed55 |
hex | 5cf5a54fc822 |
102210110212130 has 64 divisors (see below), whose sum is σ = 192300824272896. Its totient is φ = 39040576344000.
The previous prime is 102210110212117. The next prime is 102210110212157. The reversal of 102210110212130 is 31212011012201.
It is a happy number.
It is a super-3 number, since 3×1022101102121303 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 102210110212099 and 102210110212108.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1737321815 + ... + 1737380645.
It is an arithmetic number, because the mean of its divisors is an integer number (3004700379264).
Almost surely, 2102210110212130 is an apocalyptic number.
102210110212130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102210110212130 is a deficient number, since it is larger than the sum of its proper divisors (90090714060766).
102210110212130 is a wasteful number, since it uses less digits than its factorization.
102210110212130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71463.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 102210110212130 its reverse (31212011012201), we get a palindrome (133422121224331).
The spelling of 102210110212130 in words is "one hundred two trillion, two hundred ten billion, one hundred ten million, two hundred twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.850 sec. • engine limits •