Base | Representation |
---|---|
bin | 100111010101111… |
… | …0010001001001111 |
3 | 10102000000001100120 |
4 | 1032223302021033 |
5 | 10200421203211 |
6 | 334554200023 |
7 | 44466445206 |
oct | 11653621117 |
9 | 3360001316 |
10 | 1320100431 |
11 | 618186aa1 |
12 | 30a123013 |
13 | 180655020 |
14 | c747423d |
15 | 7ad60d06 |
hex | 4eaf224f |
1320100431 has 32 divisors (see below), whose sum is σ = 1920511488. Its totient is φ = 801740160.
The previous prime is 1320100403. The next prime is 1320100447. The reversal of 1320100431 is 1340010231.
It is not a de Polignac number, because 1320100431 - 213 = 1320092239 is a prime.
It is a super-2 number, since 2×13201004312 = 3485330295852771522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1320100431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320100631) 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 31 ways as a sum of consecutive naturals, for example, 1021896 + ... + 1023186.
It is an arithmetic number, because the mean of its divisors is an integer number (60015984).
Almost surely, 21320100431 is an apocalyptic number.
1320100431 is a deficient number, since it is larger than the sum of its proper divisors (600411057).
1320100431 is a wasteful number, since it uses less digits than its factorization.
1320100431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1320100431 is about 36333.1863590299. The cubic root of 1320100431 is about 1096.9891302157.
Adding to 1320100431 its reverse (1340010231), we get a palindrome (2660110662).
The spelling of 1320100431 in words is "one billion, three hundred twenty million, one hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •