Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0101001110101000000 |
3 | 100122222202112011120021 |
4 | 1132022310221311000 |
5 | 3124040001301212 |
6 | 114241213023224 |
7 | 10206452631565 |
oct | 1361264516500 |
9 | 318882464507 |
10 | 101113306432 |
11 | 39977909766 |
12 | 1771a784b14 |
13 | 96c536bc48 |
14 | 4c72c6486c |
15 | 296bd4d307 |
hex | 178ad29d40 |
101113306432 has 28 divisors (see below), whose sum is σ = 200661582420. Its totient is φ = 50552907776.
The previous prime is 101113306421. The next prime is 101113306447. The reversal of 101113306432 is 234603311101.
It can be written as a sum of positive squares in 2 ways, for example, as 39993600256 + 61119706176 = 199984^2 + 247224^2 .
It is a super-2 number, since 2×1011133064322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101113306397 and 101113306406.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 945678 + ... + 1047154.
Almost surely, 2101113306432 is an apocalyptic number.
It is an amenable number.
101113306432 is a deficient number, since it is larger than the sum of its proper divisors (99548275988).
101113306432 is a wasteful number, since it uses less digits than its factorization.
101113306432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117058 (or 117048 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 101113306432 its reverse (234603311101), we get a palindrome (335716617533).
The spelling of 101113306432 in words is "one hundred one billion, one hundred thirteen million, three hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •