Base | Representation |
---|---|
bin | 11101100101110101000111… |
… | …010110110111001000010010 |
3 | 122001210112211112000111121011 |
4 | 131211311013112313020102 |
5 | 114024230331302231120 |
6 | 1140442511442121134 |
7 | 36261343615020325 |
oct | 3545650726671022 |
9 | 561715745014534 |
10 | 130143001211410 |
11 | 385163783a9980 |
12 | 1271a7039501aa |
13 | 5780580b63c05 |
14 | 241cd5222a7bc |
15 | 100a4b89ecc5a |
hex | 765d475b7212 |
130143001211410 has 32 divisors (see below), whose sum is σ = 255756511281600. Its totient is φ = 47287138522560.
The previous prime is 130143001211407. The next prime is 130143001211413. The reversal of 130143001211410 is 14112100341031.
It is an interprime number because it is at equal distance from previous prime (130143001211407) and next prime (130143001211413).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (130143001211413) 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, 469725765 + ... + 470002744.
It is an arithmetic number, because the mean of its divisors is an integer number (7992390977550).
Almost surely, 2130143001211410 is an apocalyptic number.
130143001211410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130143001211410 is a deficient number, since it is larger than the sum of its proper divisors (125613510070190).
130143001211410 is a wasteful number, since it uses less digits than its factorization.
130143001211410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939729786.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 130143001211410 its reverse (14112100341031), we get a palindrome (144255101552441).
The spelling of 130143001211410 in words is "one hundred thirty trillion, one hundred forty-three billion, one million, two hundred eleven thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •