Base | Representation |
---|---|
bin | 100110101111100… |
… | …1001010001111110 |
3 | 10100121012100121121 |
4 | 1031133021101332 |
5 | 10130300310420 |
6 | 332555421154 |
7 | 44133621640 |
oct | 11537112176 |
9 | 3317170547 |
10 | 1300010110 |
11 | 607904923 |
12 | 3034547ba |
13 | 17943c769 |
14 | c4924890 |
15 | 791e32aa |
hex | 4d7c947e |
1300010110 has 64 divisors (see below), whose sum is σ = 2769076224. Its totient is φ = 430012800.
The previous prime is 1300010069. The next prime is 1300010123. The reversal of 1300010110 is 110100031.
It is a happy number.
It is a super-2 number, since 2×13000101102 = 3380052572204424200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 1300010093 and 1300010102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 912859 + ... + 914281.
It is an arithmetic number, because the mean of its divisors is an integer number (43266816).
Almost surely, 21300010110 is an apocalyptic number.
1300010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1300010110 is an abundant number, since it is smaller than the sum of its proper divisors (1469066114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300010110 is a wasteful number, since it uses less digits than its factorization.
1300010110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1889.
The product of its (nonzero) digits is 3, while the sum is 7.
The square root of 1300010110 is about 36055.6529548419. The cubic root of 1300010110 is about 1091.3957122799.
Adding to 1300010110 its reverse (110100031), we get a palindrome (1410110141).
The spelling of 1300010110 in words is "one billion, three hundred million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •