Base | Representation |
---|---|
bin | 11101001001010001111… |
… | …00011111000011001110 |
3 | 10112201211021201112212100 |
4 | 32210220330133003032 |
5 | 112401344031340210 |
6 | 2044013212215530 |
7 | 132230660211612 |
oct | 16445074370316 |
9 | 3481737645770 |
10 | 1001414324430 |
11 | 356774308863 |
12 | 1420b776a5a6 |
13 | 735822c12c0 |
14 | 3667c207342 |
15 | 1b0b09da5c0 |
hex | e928f1f0ce |
1001414324430 has 48 divisors (see below), whose sum is σ = 2803960111680. Its totient is φ = 246501987264.
The previous prime is 1001414324399. The next prime is 1001414324513. The reversal of 1001414324430 is 344234141001.
1001414324430 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 414 + 3 + 244 + 3 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 1001414324394 and 1001414324403.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 427953670 + ... + 427956009.
It is an arithmetic number, because the mean of its divisors is an integer number (58415835660).
Almost surely, 21001414324430 is an apocalyptic number.
1001414324430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1001414324430 is an abundant number, since it is smaller than the sum of its proper divisors (1802545787250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001414324430 is a wasteful number, since it uses less digits than its factorization.
1001414324430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855909705 (or 855909702 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 1001414324430 its reverse (344234141001), we get a palindrome (1345648465431).
The spelling of 1001414324430 in words is "one trillion, one billion, four hundred fourteen million, three hundred twenty-four thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •