Base | Representation |
---|---|
bin | 11101001001010001111… |
… | …00110100111110011000 |
3 | 10112201211021220010001100 |
4 | 32210220330310332120 |
5 | 112401344042223412 |
6 | 2044013214151400 |
7 | 132230661034461 |
oct | 16445074647630 |
9 | 3481737803040 |
10 | 1001414414232 |
11 | 35677436a281 |
12 | 1420b77b2560 |
13 | 7358232313b |
14 | 3667c22bd68 |
15 | 1b0b0a06edc |
hex | e928f34f98 |
1001414414232 has 48 divisors (see below), whose sum is σ = 2715864269040. Its totient is φ = 333349391808.
The previous prime is 1001414414227. The next prime is 1001414414249. The reversal of 1001414414232 is 2324144141001.
1001414414232 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 4 + 14 + 414 + 232 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 1001414414196 and 1001414414205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9434628 + ... + 9540179.
It is an arithmetic number, because the mean of its divisors is an integer number (56580505605).
Almost surely, 21001414414232 is an apocalyptic number.
1001414414232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1001414414232 is an abundant number, since it is smaller than the sum of its proper divisors (1714449854808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001414414232 is a wasteful number, since it uses less digits than its factorization.
1001414414232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18975552 (or 18975545 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 1001414414232 its reverse (2324144141001), we get a palindrome (3325558555233).
The spelling of 1001414414232 in words is "one trillion, one billion, four hundred fourteen million, four hundred fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •