Base | Representation |
---|---|
bin | 10110101111101010010101… |
… | …110001000110101001100000 |
3 | 111010011222212001100102001122 |
4 | 112233222111301012221200 |
5 | 101102412123024020222 |
6 | 552430112113151412 |
7 | 30033044446132601 |
oct | 2657522561065140 |
9 | 433158761312048 |
10 | 100032301001312 |
11 | 29967508095589 |
12 | b276b1b25b568 |
13 | 43a800c143b84 |
14 | 1a9b836aa9da8 |
15 | b8710a416a42 |
hex | 5afa95c46a60 |
100032301001312 has 12 divisors (see below), whose sum is σ = 196938592596396. Its totient is φ = 50016150500640.
The previous prime is 100032301001287. The next prime is 100032301001323. The reversal of 100032301001312 is 213100103230001.
It is a super-2 number, since 2×1000323010013122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 1563004703114 + ... + 1563004703177.
It is an arithmetic number, because the mean of its divisors is an integer number (16411549383033).
Almost surely, 2100032301001312 is an apocalyptic number.
It is an amenable number.
100032301001312 is a deficient number, since it is larger than the sum of its proper divisors (96906291595084).
100032301001312 is an equidigital number, since it uses as much as digits as its factorization.
100032301001312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3126009406301 (or 3126009406293 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100032301001312 its reverse (213100103230001), we get a palindrome (313132404231313).
The spelling of 100032301001312 in words is "one hundred trillion, thirty-two billion, three hundred one million, one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •