Base | Representation |
---|---|
bin | 10111001111100000111011… |
… | …000010110010100101000000 |
3 | 111101221020211001000002200102 |
4 | 113033200323002302211000 |
5 | 101344243020312411000 |
6 | 1001223435425341532 |
7 | 30350144634453311 |
oct | 2717407302624500 |
9 | 441836731002612 |
10 | 102221212232000 |
11 | 2a630855449004 |
12 | b56b1a51978a8 |
13 | 450655a58c044 |
14 | 1b35766a60608 |
15 | bc401d0e23d5 |
hex | 5cf83b0b2940 |
102221212232000 has 112 divisors (see below), whose sum is σ = 253533826799760. Its totient is φ = 40826624256000.
The previous prime is 102221212231967. The next prime is 102221212232017. The reversal of 102221212232000 is 232212122201.
It can be written as a sum of positive squares in 8 ways, for example, as 2992678564096 + 99228533667904 = 1729936^2 + 9961352^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4377395 + ... + 14953394.
Almost surely, 2102221212232000 is an apocalyptic number.
102221212232000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102221212232000 is an abundant number, since it is smaller than the sum of its proper divisors (151312614567760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102221212232000 is an equidigital number, since it uses as much as digits as its factorization.
102221212232000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19331477 (or 19331457 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 102221212232000 its reverse (232212122201), we get a palindrome (102453424354201).
The spelling of 102221212232000 in words is "one hundred two trillion, two hundred twenty-one billion, two hundred twelve million, two hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •