Base | Representation |
---|---|
bin | 10111001111010111100110… |
… | …010100111110011011110010 |
3 | 111101220021222100002212210120 |
4 | 113033113212110332123302 |
5 | 101344112014424014302 |
6 | 1001215102202111110 |
7 | 30346341562424436 |
oct | 2717274624763362 |
9 | 441807870085716 |
10 | 102211201001202 |
11 | 2a627588363147 |
12 | b5692704ab496 |
13 | 450562346ba37 |
14 | 1b350972169c6 |
15 | bc3b342669bc |
hex | 5cf5e653e6f2 |
102211201001202 has 32 divisors (see below), whose sum is σ = 218433003782400. Its totient is φ = 31772073270528.
The previous prime is 102211201001191. The next prime is 102211201001233. The reversal of 102211201001202 is 202100102112201.
It is a super-2 number, since 2×1022112010012022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4596643002 + ... + 4596665237.
It is an arithmetic number, because the mean of its divisors is an integer number (6826031368200).
Almost surely, 2102211201001202 is an apocalyptic number.
102211201001202 is an abundant number, since it is smaller than the sum of its proper divisors (116221802781198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102211201001202 is a wasteful number, since it uses less digits than its factorization.
102211201001202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9193308370.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102211201001202 its reverse (202100102112201), we get a palindrome (304311303113403).
The spelling of 102211201001202 in words is "one hundred two trillion, two hundred eleven billion, two hundred one million, one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.588 sec. • engine limits •