Base | Representation |
---|---|
bin | 101111100000110010… |
… | …1001110101100010000 |
3 | 100202100210020010221100 |
4 | 1133001211032230100 |
5 | 3132430143310000 |
6 | 114512312024400 |
7 | 10241306526624 |
oct | 1370145165420 |
9 | 322323203840 |
10 | 102032010000 |
11 | 3a2a9456308 |
12 | 17936392100 |
13 | 98107b391b |
14 | 4d1cc8d184 |
15 | 29c2821a00 |
hex | 17c194eb10 |
102032010000 has 150 divisors (see below), whose sum is σ = 356820991670. Its totient is φ = 27208512000.
The previous prime is 102032009999. The next prime is 102032010011. The reversal of 102032010000 is 10230201.
It is a happy number.
It can be written as a sum of positive squares in 5 ways, for example, as 59944666896 + 42087343104 = 244836^2 + 205152^2 .
It is a tau number, because it is divible by the number of its divisors (150).
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 (17) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 476845 + ... + 656844.
Almost surely, 2102032010000 is an apocalyptic number.
102032010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102032010000 is an abundant number, since it is smaller than the sum of its proper divisors (254788981670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102032010000 is a wasteful number, since it uses less digits than its factorization.
102032010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133723 (or 1133699 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 102032010000 its reverse (10230201), we get a palindrome (102042240201).
The spelling of 102032010000 in words is "one hundred two billion, thirty-two million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •