Base | Representation |
---|---|
bin | 1011110101110101011… |
… | …1111001110010110000 |
3 | 201110002101110020201000 |
4 | 2331131113321302300 |
5 | 11313111040310112 |
6 | 233242055042000 |
7 | 20461120361154 |
oct | 2753527716260 |
9 | 643071406630 |
10 | 203430010032 |
11 | 79301a34537 |
12 | 33514370300 |
13 | 1624cb21702 |
14 | 9bbb861064 |
15 | 54596587dc |
hex | 2f5d5f9cb0 |
203430010032 has 80 divisors (see below), whose sum is σ = 583974096480. Its totient is φ = 67803660288.
The previous prime is 203430010019. The next prime is 203430010067. The reversal of 203430010032 is 230010034302.
203430010032 is a `hidden beast` number, since 203 + 430 + 0 + 1 + 0 + 0 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 203430009987 and 203430010014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7874128 + ... + 7899920.
It is an arithmetic number, because the mean of its divisors is an integer number (7299676206).
Almost surely, 2203430010032 is an apocalyptic number.
It is an amenable number.
203430010032 is an abundant number, since it is smaller than the sum of its proper divisors (380544086448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203430010032 is a wasteful number, since it uses less digits than its factorization.
203430010032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44067 (or 44055 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 203430010032 its reverse (230010034302), we get a palindrome (433440044334).
The spelling of 203430010032 in words is "two hundred three billion, four hundred thirty million, ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •