Base | Representation |
---|---|
bin | 11101101010001100100010… |
… | …100001101110110000001010 |
3 | 122002212020021010000200101002 |
4 | 131222030202201232300022 |
5 | 114044134311414430120 |
6 | 1141232411242055002 |
7 | 36322124624201132 |
oct | 3552144241566012 |
9 | 562766233020332 |
10 | 130443031014410 |
11 | 38621640401654 |
12 | 127688971aa462 |
13 | 57a2956bc8c1a |
14 | 242d6952c9ac2 |
15 | 10131c8ae7375 |
hex | 76a32286ec0a |
130443031014410 has 8 divisors (see below), whose sum is σ = 234797455825956. Its totient is φ = 52177212405760.
The previous prime is 130443031014407. The next prime is 130443031014479. The reversal of 130443031014410 is 14410130344031.
It can be written as a sum of positive squares in 2 ways, for example, as 129384414324529 + 1058616689881 = 11374727^2 + 1028891^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6522151550711 + ... + 6522151550730.
Almost surely, 2130443031014410 is an apocalyptic number.
130443031014410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130443031014410 is a deficient number, since it is larger than the sum of its proper divisors (104354424811546).
130443031014410 is a wasteful number, since it uses less digits than its factorization.
130443031014410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13044303101448.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 130443031014410 its reverse (14410130344031), we get a palindrome (144853161358441).
The spelling of 130443031014410 in words is "one hundred thirty trillion, four hundred forty-three billion, thirty-one million, fourteen thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •