Base | Representation |
---|---|
bin | 10011000110001011001… |
… | …011010011000100111110 |
3 | 11122110021110000012200120 |
4 | 103012023023103010332 |
5 | 133000042301120110 |
6 | 2442510131435410 |
7 | 163545006060156 |
oct | 23061313230476 |
9 | 4573243005616 |
10 | 1312300020030 |
11 | 4665a81712aa |
12 | 1923ba755b66 |
13 | 96998465bbc |
14 | 47730d83766 |
15 | 24208baa870 |
hex | 1318b2d313e |
1312300020030 has 64 divisors (see below), whose sum is σ = 3286658723328. Its totient is φ = 334710921600.
The previous prime is 1312300020029. The next prime is 1312300020037. The reversal of 1312300020030 is 300200032131.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 1312300019991 and 1312300020009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312300020037) 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, 13327980 + ... + 13426080.
It is an arithmetic number, because the mean of its divisors is an integer number (51354042552).
Almost surely, 21312300020030 is an apocalyptic number.
1312300020030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1312300020030 is an abundant number, since it is smaller than the sum of its proper divisors (1974358703298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1312300020030 is a wasteful number, since it uses less digits than its factorization.
1312300020030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117521.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 1312300020030 its reverse (300200032131), we get a palindrome (1612500052161).
The spelling of 1312300020030 in words is "one trillion, three hundred twelve billion, three hundred million, twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •