Base | Representation |
---|---|
bin | 10111001111010111101100… |
… | …010111000001110001000000 |
3 | 111101220022020101112102210021 |
4 | 113033113230113001301000 |
5 | 101344112221330434212 |
6 | 1001215120215143224 |
7 | 30346344231551653 |
oct | 2717275427016100 |
9 | 441808211472707 |
10 | 102211302202432 |
11 | 2a62762a4a5125 |
12 | b56929a374b14 |
13 | 450563b413217 |
14 | 1b350a683b89a |
15 | bc3b3d0a7307 |
hex | 5cf5ec5c1c40 |
102211302202432 has 56 divisors (see below), whose sum is σ = 204724603971360. Its totient is φ = 50627166289920.
The previous prime is 102211302202411. The next prime is 102211302202481. The reversal of 102211302202432 is 234202203112201.
It is a super-2 number, since 2×1022113022024322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102211302202397 and 102211302202406.
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 7 ways as a sum of consecutive naturals, for example, 631160832 + ... + 631322752.
Almost surely, 2102211302202432 is an apocalyptic number.
It is an amenable number.
102211302202432 is an abundant number, since it is smaller than the sum of its proper divisors (102513301768928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102211302202432 is a wasteful number, since it uses less digits than its factorization.
102211302202432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254219 (or 254209 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 102211302202432 its reverse (234202203112201), we get a palindrome (336413505314633).
The spelling of 102211302202432 in words is "one hundred two trillion, two hundred eleven billion, three hundred two million, two hundred two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •