Base | Representation |
---|---|
bin | 10011000010010010001… |
… | …101100111011110101101 |
3 | 11122001111100101202002111 |
4 | 103002102031213132231 |
5 | 132413014003213401 |
6 | 2440535441524021 |
7 | 163336336620025 |
oct | 23022215473655 |
9 | 4561440352074 |
10 | 1308123101101 |
11 | 46485442a293 |
12 | 191633943611 |
13 | 96480cabb3b |
14 | 47456338a85 |
15 | 24062139e51 |
hex | 130923677ad |
1308123101101 has 8 divisors (see below), whose sum is σ = 1324026440640. Its totient is φ = 1292287870848.
The previous prime is 1308123101099. The next prime is 1308123101123. The reversal of 1308123101101 is 1011013218031.
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 1308123101101 - 21 = 1308123101099 is a prime.
It is a super-2 number, since 2×13081231011012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1308123101161) 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, 16988676 + ... + 17065501.
It is an arithmetic number, because the mean of its divisors is an integer number (165503305080).
Almost surely, 21308123101101 is an apocalyptic number.
It is an amenable number.
1308123101101 is a deficient number, since it is larger than the sum of its proper divisors (15903339539).
1308123101101 is a wasteful number, since it uses less digits than its factorization.
1308123101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34054643.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 1308123101101 its reverse (1011013218031), we get a palindrome (2319136319132).
The spelling of 1308123101101 in words is "one trillion, three hundred eight billion, one hundred twenty-three million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •