Base | Representation |
---|---|
bin | 10010111010111011111… |
… | …111111000101101010011 |
3 | 11121022010120001120010110 |
4 | 102322323333320231103 |
5 | 132300334424211011 |
6 | 2433152551332403 |
7 | 162640005300633 |
oct | 22727377705523 |
9 | 4538116046113 |
10 | 1300234210131 |
11 | 46147635078a |
12 | 18bbb1981103 |
13 | 957c479bb0c |
14 | 46d087146c3 |
15 | 23c4e78aba6 |
hex | 12ebbff8b53 |
1300234210131 has 8 divisors (see below), whose sum is σ = 1733760023184. Its totient is φ = 866765601920.
The previous prime is 1300234210129. The next prime is 1300234210199. The reversal of 1300234210131 is 1310124320031.
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 1300234210131 - 21 = 1300234210129 is a prime.
It is a super-2 number, since 2×13002342101312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1300234210098 and 1300234210107.
It is not an unprimeable number, because it can be changed into a prime (1300234210111) 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, 14248146 + ... + 14339111.
It is an arithmetic number, because the mean of its divisors is an integer number (216720002898).
Almost surely, 21300234210131 is an apocalyptic number.
1300234210131 is a deficient number, since it is larger than the sum of its proper divisors (433525813053).
1300234210131 is a wasteful number, since it uses less digits than its factorization.
1300234210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28602421.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1300234210131 its reverse (1310124320031), we get a palindrome (2610358530162).
The spelling of 1300234210131 in words is "one trillion, three hundred billion, two hundred thirty-four million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •