Base | Representation |
---|---|
bin | 1001001110010010111101… |
… | …0010110011001001111010 |
3 | 1022220111020110002122210020 |
4 | 2103210233102303021322 |
5 | 2312123200034240010 |
6 | 33322450320031310 |
7 | 2064451445166552 |
oct | 223445722631172 |
9 | 38814213078706 |
10 | 10141211243130 |
11 | 325a955403040 |
12 | 1179527162536 |
13 | 58740994a316 |
14 | 270ba1576162 |
15 | 128be2171470 |
hex | 9392f4b327a |
10141211243130 has 32 divisors (see below), whose sum is σ = 26551534891968. Its totient is φ = 2458475452800.
The previous prime is 10141211243117. The next prime is 10141211243179. The reversal of 10141211243130 is 3134211214101.
It is a self number, because there is not a number n which added to its sum of digits gives 10141211243130.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15365471251 + ... + 15365471910.
It is an arithmetic number, because the mean of its divisors is an integer number (829735465374).
Almost surely, 210141211243130 is an apocalyptic number.
10141211243130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10141211243130 is an abundant number, since it is smaller than the sum of its proper divisors (16410323648838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141211243130 is a wasteful number, since it uses less digits than its factorization.
10141211243130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30730943182.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 10141211243130 its reverse (3134211214101), we get a palindrome (13275422457231).
The spelling of 10141211243130 in words is "ten trillion, one hundred forty-one billion, two hundred eleven million, two hundred forty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •