Base | Representation |
---|---|
bin | 10111010000101101010011… |
… | …110100001011110000100000 |
3 | 111102020002112011001210022110 |
4 | 113100231103310023300200 |
5 | 101402114004421241000 |
6 | 1001325242302235320 |
7 | 30356110315003401 |
oct | 2720552364136040 |
9 | 442202464053273 |
10 | 102303232212000 |
11 | 2a6626145a8a46 |
12 | b583075585b40 |
13 | 45111cc0454a1 |
14 | 1b39707bb59a8 |
15 | bc621dabd850 |
hex | 5d0b53d0bc20 |
102303232212000 has 96 divisors (see below), whose sum is σ = 335145388765824. Its totient is φ = 27280861920000.
The previous prime is 102303232211951. The next prime is 102303232212011. The reversal of 102303232212000 is 212232303201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
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, 4262622676 + ... + 4262646675.
It is an arithmetic number, because the mean of its divisors is an integer number (3491097799644).
Almost surely, 2102303232212000 is an apocalyptic number.
102303232212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102303232212000 is an abundant number, since it is smaller than the sum of its proper divisors (232842156553824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102303232212000 is an equidigital number, since it uses as much as digits as its factorization.
102303232212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8525269379 (or 8525269361 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 102303232212000 its reverse (212232303201), we get a palindrome (102515464515201).
The spelling of 102303232212000 in words is "one hundred two trillion, three hundred three billion, two hundred thirty-two million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •