Base | Representation |
---|---|
bin | 10010111100101100111… |
… | …111110111111001100111 |
3 | 11121111000200101022010210 |
4 | 102330230333313321213 |
5 | 132313230242012411 |
6 | 2434105033350503 |
7 | 163034665440030 |
oct | 22745477677147 |
9 | 4544020338123 |
10 | 1302130032231 |
11 | 462259502a06 |
12 | 190440868433 |
13 | 95a3749bb42 |
14 | 47048411a87 |
15 | 23d10e20ca6 |
hex | 12f2cff7e67 |
1302130032231 has 32 divisors (see below), whose sum is σ = 2017026457600. Its totient is φ = 731767322880.
The previous prime is 1302130032223. The next prime is 1302130032251. The reversal of 1302130032231 is 1322300312031.
It is not a de Polignac number, because 1302130032231 - 23 = 1302130032223 is a prime.
It is a super-2 number, since 2×13021300322312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1302130032198 and 1302130032207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302130032251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8944755 + ... + 9089163.
It is an arithmetic number, because the mean of its divisors is an integer number (63032076800).
Almost surely, 21302130032231 is an apocalyptic number.
1302130032231 is a deficient number, since it is larger than the sum of its proper divisors (714896425369).
1302130032231 is a wasteful number, since it uses less digits than its factorization.
1302130032231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151519.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1302130032231 its reverse (1322300312031), we get a palindrome (2624430344262).
The spelling of 1302130032231 in words is "one trillion, three hundred two billion, one hundred thirty million, thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •