Base | Representation |
---|---|
bin | 10111001110000100100010… |
… | …010000101111101110011010 |
3 | 111101120202202121122221212010 |
4 | 113032010202100233232122 |
5 | 101341131340111241442 |
6 | 1001110112120530350 |
7 | 30340033443266340 |
oct | 2716044220575632 |
9 | 441522677587763 |
10 | 102122012212122 |
11 | 2a5a277a63a901 |
12 | b553b1b3209b6 |
13 | 44ca0ab726426 |
14 | 1b30a35d61990 |
15 | bc1664228b9c |
hex | 5ce12242fb9a |
102122012212122 has 64 divisors (see below), whose sum is σ = 234641244625920. Its totient is φ = 29025292944384.
The previous prime is 102122012212117. The next prime is 102122012212139. The reversal of 102122012212122 is 221212210221201.
It is a super-3 number, since 3×1021220122121223 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 197682453 + ... + 198198375.
It is an arithmetic number, because the mean of its divisors is an integer number (3666269447280).
Almost surely, 2102122012212122 is an apocalyptic number.
102122012212122 is an abundant number, since it is smaller than the sum of its proper divisors (132519232413798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102122012212122 is a wasteful number, since it uses less digits than its factorization.
102122012212122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540547.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 102122012212122 its reverse (221212210221201), we get a palindrome (323334222433323).
The spelling of 102122012212122 in words is "one hundred two trillion, one hundred twenty-two billion, twelve million, two hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •