Base | Representation |
---|---|
bin | 101111100011011100… |
… | …1100000110110000000 |
3 | 100202121000002010212201 |
4 | 1133012321200312000 |
5 | 3133121012311222 |
6 | 114525220002544 |
7 | 10243441663606 |
oct | 1370671406600 |
9 | 322530063781 |
10 | 102121213312 |
11 | 3a344843058 |
12 | 17960230454 |
13 | 9826117051 |
14 | 4d2aa6d876 |
15 | 29ca592427 |
hex | 17c6e60d80 |
102121213312 has 48 divisors (see below), whose sum is σ = 205927054380. Its totient is φ = 50444983040.
The previous prime is 102121213301. The next prime is 102121213339. The reversal of 102121213312 is 213312121201.
It is a self number, because there is not a number n which added to its sum of digits gives 102121213312.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 823887 + ... + 939697.
Almost surely, 2102121213312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102121213312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102963527190).
102121213312 is an abundant number, since it is smaller than the sum of its proper divisors (103805841068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121213312 is an frugal number, since it uses more digits than its factorization.
102121213312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115991 (or 115896 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 102121213312 its reverse (213312121201), we get a palindrome (315433334513).
The spelling of 102121213312 in words is "one hundred two billion, one hundred twenty-one million, two hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •