Base | Representation |
---|---|
bin | 1001001110010010111100… |
… | …1110100110101001001110 |
3 | 1022220111020101000210010011 |
4 | 2103210233032212221032 |
5 | 2312123144244041220 |
6 | 33322450240303434 |
7 | 2064451432636231 |
oct | 223445716465116 |
9 | 38814211023104 |
10 | 10141210143310 |
11 | 325a9548217a4 |
12 | 1179526911b7a |
13 | 58740965383c |
14 | 270ba136b418 |
15 | 128be200565a |
hex | 9392f3a6a4e |
10141210143310 has 32 divisors (see below), whose sum is σ = 18786030724800. Its totient is φ = 3938744869632.
The previous prime is 10141210143299. The next prime is 10141210143353. The reversal of 10141210143310 is 1334101214101.
It is a super-2 number, since 2×101412101433102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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, 27960135 + ... + 28320514.
It is an arithmetic number, because the mean of its divisors is an integer number (587063460150).
Almost surely, 210141210143310 is an apocalyptic number.
10141210143310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10141210143310 is a deficient number, since it is larger than the sum of its proper divisors (8644820581490).
10141210143310 is a wasteful number, since it uses less digits than its factorization.
10141210143310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56281180.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 10141210143310 its reverse (1334101214101), we get a palindrome (11475311357411).
The spelling of 10141210143310 in words is "ten trillion, one hundred forty-one billion, two hundred ten million, one hundred forty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •