Base | Representation |
---|---|
bin | 100110110000010… |
… | …1000011110010111 |
3 | 10100121221011110211 |
4 | 1031200220132113 |
5 | 10130400300043 |
6 | 333012030251 |
7 | 44140134466 |
oct | 11540503627 |
9 | 3317834424 |
10 | 1300400023 |
11 | 60805086a |
12 | 303602387 |
13 | 179548090 |
14 | c49c69dd |
15 | 7926da9d |
hex | 4d828797 |
1300400023 has 16 divisors (see below), whose sum is σ = 1517304096. Its totient is φ = 1103477760.
The previous prime is 1300400021. The next prime is 1300400041. The reversal of 1300400023 is 3200040031.
It is a cyclic number.
It is not a de Polignac number, because 1300400023 - 21 = 1300400021 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1300399976 and 1300400012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300400021) 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, 58918 + ... + 77923.
It is an arithmetic number, because the mean of its divisors is an integer number (94831506).
Almost surely, 21300400023 is an apocalyptic number.
1300400023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1300400023 is a deficient number, since it is larger than the sum of its proper divisors (216904073).
1300400023 is a wasteful number, since it uses less digits than its factorization.
1300400023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136914.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 1300400023 is about 36061.0596488789. The cubic root of 1300400023 is about 1091.5048157490.
Adding to 1300400023 its reverse (3200040031), we get a palindrome (4500440054).
The spelling of 1300400023 in words is "one billion, three hundred million, four hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •