Base | Representation |
---|---|
bin | 1001000110111010010000… |
… | …0000101100110110110100 |
3 | 1022110100201012121122221222 |
4 | 2101232210000230312310 |
5 | 2303033312011223012 |
6 | 33144303145125512 |
7 | 2052340124014646 |
oct | 221564400546664 |
9 | 38410635548858 |
10 | 10014320414132 |
11 | 321105a88a121 |
12 | 1158a13789898 |
13 | 578466c61c58 |
14 | 2689a4db0896 |
15 | 125767268972 |
hex | 91ba402cdb4 |
10014320414132 has 6 divisors (see below), whose sum is σ = 17525060724738. Its totient is φ = 5007160207064.
The previous prime is 10014320414129. The next prime is 10014320414149. The reversal of 10014320414132 is 23141402341001.
It can be written as a sum of positive squares in only one way, i.e., 5439837863716 + 4574482550416 = 2332346^2 + 2138804^2 .
It is a super-2 number, since 2×100143204141322 (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 (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1251790051763 + ... + 1251790051770.
It is an arithmetic number, because the mean of its divisors is an integer number (2920843454123).
Almost surely, 210014320414132 is an apocalyptic number.
It is an amenable number.
10014320414132 is a deficient number, since it is larger than the sum of its proper divisors (7510740310606).
10014320414132 is a wasteful number, since it uses less digits than its factorization.
10014320414132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2503580103537 (or 2503580103535 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 10014320414132 its reverse (23141402341001), we get a palindrome (33155722755133).
The spelling of 10014320414132 in words is "ten trillion, fourteen billion, three hundred twenty million, four hundred fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •