Base | Representation |
---|---|
bin | 10111101101111010010000… |
… | …100000001111000011000001 |
3 | 111200022221100020220222200211 |
4 | 113231322100200033003001 |
5 | 102133003340012320001 |
6 | 1005503204051114121 |
7 | 30654102020532604 |
oct | 2755722040170301 |
9 | 450287306828624 |
10 | 104310000120001 |
11 | 30266693791225 |
12 | b847b87ba2941 |
13 | 46285107a0240 |
14 | 1ba88b944833b |
15 | c0d520d1c351 |
hex | 5ede9080f0c1 |
104310000120001 has 16 divisors (see below), whose sum is σ = 113442374141824. Its totient is φ = 95336282409984.
The previous prime is 104310000119999. The next prime is 104310000120013. The reversal of 104310000120001 is 100021000013401.
It is a cyclic number.
It is not a de Polignac number, because 104310000120001 - 21 = 104310000119999 is a prime.
It is a super-2 number, since 2×1043100001200012 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (104310000120041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2338690 + ... + 14631796.
It is an arithmetic number, because the mean of its divisors is an integer number (7090148383864).
Almost surely, 2104310000120001 is an apocalyptic number.
It is an amenable number.
104310000120001 is a deficient number, since it is larger than the sum of its proper divisors (9132374021823).
104310000120001 is a wasteful number, since it uses less digits than its factorization.
104310000120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12299560.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 104310000120001 its reverse (100021000013401), we get a palindrome (204331000133402).
The spelling of 104310000120001 in words is "one hundred four trillion, three hundred ten billion, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •