Base | Representation |
---|---|
bin | 10100011000001000011… |
… | …100110110110111110101 |
3 | 11221212102101121022211222 |
4 | 110120020130312313311 |
5 | 140420304041333023 |
6 | 2551142304440125 |
7 | 203111524065614 |
oct | 24301034666765 |
9 | 4855371538758 |
10 | 1400301121013 |
11 | 49a956527a33 |
12 | 1a747a019045 |
13 | a2081107ca2 |
14 | 4babc5d187b |
15 | 266597e0cc8 |
hex | 14608736df5 |
1400301121013 has 8 divisors (see below), whose sum is σ = 1400807485440. Its totient is φ = 1399794858000.
The previous prime is 1400301120901. The next prime is 1400301121061. The reversal of 1400301121013 is 3101211030041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1400301121013 - 212 = 1400301116917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1400301120982 and 1400301121000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1400301121913) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36351263 + ... + 36389763.
It is an arithmetic number, because the mean of its divisors is an integer number (175100935680).
Almost surely, 21400301121013 is an apocalyptic number.
It is an amenable number.
1400301121013 is a deficient number, since it is larger than the sum of its proper divisors (506364427).
1400301121013 is an equidigital number, since it uses as much as digits as its factorization.
1400301121013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50707.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1400301121013 its reverse (3101211030041), we get a palindrome (4501512151054).
The spelling of 1400301121013 in words is "one trillion, four hundred billion, three hundred one million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •