Base | Representation |
---|---|
bin | 10010111010110101010… |
… | …111101010101000010101 |
3 | 11121021211210210200012010 |
4 | 102322311113222220111 |
5 | 132300122442102123 |
6 | 2433133540014433 |
7 | 162634155122043 |
oct | 22726527525025 |
9 | 4537753720163 |
10 | 1300123003413 |
11 | 4614195a5503 |
12 | 18bb80691419 |
13 | 957a7733420 |
14 | 46cd7a47393 |
15 | 23c44b20993 |
hex | 12eb55eaa15 |
1300123003413 has 16 divisors (see below), whose sum is σ = 1927064039936. Its totient is φ = 774266800320.
The previous prime is 1300123003391. The next prime is 1300123003429. The reversal of 1300123003413 is 3143003210031.
It is not a de Polignac number, because 1300123003413 - 225 = 1300089448981 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1300123003413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300123003453) 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, 537684070 + ... + 537686487.
It is an arithmetic number, because the mean of its divisors is an integer number (120441502496).
Almost surely, 21300123003413 is an apocalyptic number.
1300123003413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1300123003413 is a deficient number, since it is larger than the sum of its proper divisors (626941036523).
1300123003413 is a wasteful number, since it uses less digits than its factorization.
1300123003413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1075370604.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1300123003413 its reverse (3143003210031), we get a palindrome (4443126213444).
The spelling of 1300123003413 in words is "one trillion, three hundred billion, one hundred twenty-three million, three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •