Base | Representation |
---|---|
bin | 101111100000110100… |
… | …1000000011001000000 |
3 | 100202100212002102222000 |
4 | 1133001221000121000 |
5 | 3132430422000000 |
6 | 114512345144000 |
7 | 10241321122131 |
oct | 1370151003100 |
9 | 322325072860 |
10 | 102033000000 |
11 | 3a2a9a72098 |
12 | 1793678b000 |
13 | 9810a6c419 |
14 | 4d1d069c88 |
15 | 29c296a000 |
hex | 17c1a40640 |
102033000000 has 392 divisors, whose sum is σ = 375042074400. Its totient is φ = 27201600000.
The previous prime is 102032999983. The next prime is 102033000031. The reversal of 102033000000 is 330201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 26998111 + ... + 27001889.
Almost surely, 2102033000000 is an apocalyptic number.
102033000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102033000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187521037200).
102033000000 is an abundant number, since it is smaller than the sum of its proper divisors (273009074400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102033000000 is an frugal number, since it uses more digits than its factorization.
102033000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3830 (or 3789 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 102033000000 its reverse (330201), we get a palindrome (102033330201).
The spelling of 102033000000 in words is "one hundred two billion, thirty-three million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •