Base | Representation |
---|---|
bin | 10010111011111011100… |
… | …110001010101110101110 |
3 | 11121101212220210202211020 |
4 | 102323323212022232232 |
5 | 132310031102210110 |
6 | 2433450505035010 |
7 | 163005312531543 |
oct | 22737346125656 |
9 | 4541786722736 |
10 | 1301301210030 |
11 | 461973676588 |
12 | 19024b185a66 |
13 | 959348670c3 |
14 | 46daa302bca |
15 | 23cb32a3d70 |
hex | 12efb98abae |
1301301210030 has 64 divisors (see below), whose sum is σ = 3287972390400. Its totient is φ = 328702320000.
The previous prime is 1301301209987. The next prime is 1301301210037. The reversal of 1301301210030 is 300121031031.
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 = 1301301209991 and 1301301210009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301301210037) 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, 3873780 + ... + 4196280.
It is an arithmetic number, because the mean of its divisors is an integer number (51374568600).
Almost surely, 21301301210030 is an apocalyptic number.
1301301210030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1301301210030 is an abundant number, since it is smaller than the sum of its proper divisors (1986671180370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301301210030 is a wasteful number, since it uses less digits than its factorization.
1301301210030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329609.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1301301210030 its reverse (300121031031), we get a palindrome (1601422241061).
The spelling of 1301301210030 in words is "one trillion, three hundred one billion, three hundred one million, two hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •