Base | Representation |
---|---|
bin | 11110000010110011110… |
… | …00000010000111111111 |
3 | 10122200112202121001012221 |
4 | 33001121320002013333 |
5 | 113403122300341111 |
6 | 2110122043510211 |
7 | 134403233216221 |
oct | 17013170020777 |
9 | 3580482531187 |
10 | 1032300012031 |
11 | 368883499012 |
12 | 148097228367 |
13 | 7646500b3b2 |
14 | 37d6c124411 |
15 | 1bcbc265371 |
hex | f059e021ff |
1032300012031 has 4 divisors (see below), whose sum is σ = 1067896564200. Its totient is φ = 996703459864.
The previous prime is 1032300012017. The next prime is 1032300012041. The reversal of 1032300012031 is 1302100032301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1032300012031 - 25 = 1032300011999 is a prime.
It is a super-2 number, since 2×10323000120312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1032300011996 and 1032300012014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032300012041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17798276041 + ... + 17798276098.
It is an arithmetic number, because the mean of its divisors is an integer number (266974141050).
Almost surely, 21032300012031 is an apocalyptic number.
1032300012031 is a deficient number, since it is larger than the sum of its proper divisors (35596552169).
1032300012031 is an equidigital number, since it uses as much as digits as its factorization.
1032300012031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35596552168.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1032300012031 its reverse (1302100032301), we get a palindrome (2334400044332).
The spelling of 1032300012031 in words is "one trillion, thirty-two billion, three hundred million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •