Base | Representation |
---|---|
bin | 11110000011000010001… |
… | …11000110100110000101 |
3 | 10122200212020000100100020 |
4 | 33001201013012212011 |
5 | 113403344334344023 |
6 | 2110142101405353 |
7 | 134406236062620 |
oct | 17014107064605 |
9 | 3580766010306 |
10 | 1032421403013 |
11 | 368935a6a940 |
12 | 14810ba09859 |
13 | 76484201490 |
14 | 37d802c2db7 |
15 | 1bcc7c42de3 |
hex | f0611c6985 |
1032421403013 has 128 divisors (see below), whose sum is σ = 1896142639104. Its totient is φ = 482391244800.
The previous prime is 1032421402993. The next prime is 1032421403029. The reversal of 1032421403013 is 3103041242301.
It is a happy number.
It is not a de Polignac number, because 1032421403013 - 222 = 1032417208709 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032421403063) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 19574245 + ... + 19626917.
It is an arithmetic number, because the mean of its divisors is an integer number (14813614368).
Almost surely, 21032421403013 is an apocalyptic number.
1032421403013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1032421403013 is a deficient number, since it is larger than the sum of its proper divisors (863721236091).
1032421403013 is a wasteful number, since it uses less digits than its factorization.
1032421403013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52875.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1032421403013 its reverse (3103041242301), we get a palindrome (4135462645314).
The spelling of 1032421403013 in words is "one trillion, thirty-two billion, four hundred twenty-one million, four hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •