Base | Representation |
---|---|
bin | 10111001111001111111110… |
… | …111000110001010000011000 |
3 | 111101212111212101221121102222 |
4 | 113033033332320301100120 |
5 | 101343443242403244000 |
6 | 1001211230505243212 |
7 | 30345632121431561 |
oct | 2717177670612030 |
9 | 441774771847388 |
10 | 102203023103000 |
11 | 2a624071129196 |
12 | b567769793508 |
13 | 450491c10c611 |
14 | 1b3491d081168 |
15 | bc380632aa85 |
hex | 5cf3fee31418 |
102203023103000 has 64 divisors (see below), whose sum is σ = 246869753944320. Its totient is φ = 39562460544000.
The previous prime is 102203023102987. The next prime is 102203023103017. The reversal of 102203023103000 is 301320302201.
It is a self number, because there is not a number n which added to its sum of digits gives 102203023103000.
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, 1648404857 + ... + 1648466856.
It is an arithmetic number, because the mean of its divisors is an integer number (3857339905380).
Almost surely, 2102203023103000 is an apocalyptic number.
102203023103000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102203023103000 is an abundant number, since it is smaller than the sum of its proper divisors (144666730841320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102203023103000 is a wasteful number, since it uses less digits than its factorization.
102203023103000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3296871765 (or 3296871751 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 102203023103000 its reverse (301320302201), we get a palindrome (102504343405201).
The spelling of 102203023103000 in words is "one hundred two trillion, two hundred three billion, twenty-three million, one hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •