Base | Representation |
---|---|
bin | 10111001111011000100001… |
… | …111100110110111100100000 |
3 | 111101220101120001100221021211 |
4 | 113033120201330312330200 |
5 | 101344121042013441112 |
6 | 1001215345334155504 |
7 | 30346405430061520 |
oct | 2717304174667440 |
9 | 441811501327254 |
10 | 102212201312032 |
11 | 2a627a50a79509 |
12 | b5694ab4b2b94 |
13 | 4505752787536 |
14 | 1b35150005680 |
15 | bc3b91eaa0a7 |
hex | 5cf621f36f20 |
102212201312032 has 48 divisors (see below), whose sum is σ = 231442277572800. Its totient is φ = 43526214920448.
The previous prime is 102212201312009. The next prime is 102212201312101. The reversal of 102212201312032 is 230213102212201.
It is a super-2 number, since 2×1022122013120322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102212201311994 and 102212201312012.
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, 1453163782 + ... + 1453234117.
It is an arithmetic number, because the mean of its divisors is an integer number (4821714116100).
Almost surely, 2102212201312032 is an apocalyptic number.
It is an amenable number.
102212201312032 is an abundant number, since it is smaller than the sum of its proper divisors (129230076260768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102212201312032 is a wasteful number, since it uses less digits than its factorization.
102212201312032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906398073 (or 2906398065 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 102212201312032 its reverse (230213102212201), we get a palindrome (332425303524233).
The spelling of 102212201312032 in words is "one hundred two trillion, two hundred twelve billion, two hundred one million, three hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •