Base | Representation |
---|---|
bin | 1001001110010110011000… |
… | …0100011101010010100010 |
3 | 1022220120121111100001101001 |
4 | 2103211212010131102202 |
5 | 2312132040314333214 |
6 | 33323121425102214 |
7 | 2064513304356046 |
oct | 223454604352242 |
9 | 38816544301331 |
10 | 10142130230434 |
11 | 3260287123884 |
12 | 1179742a8796a |
13 | 5875251611a7 |
14 | 270c4b636026 |
15 | 128c47b9dc74 |
hex | 9396611d4a2 |
10142130230434 has 8 divisors (see below), whose sum is σ = 15427465702848. Its totient is φ = 4999641662820.
The previous prime is 10142130230411. The next prime is 10142130230437. The reversal of 10142130230434 is 43403203124101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101421302304342 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10142130230437) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 35711726022 + ... + 35711726305.
It is an arithmetic number, because the mean of its divisors is an integer number (1928433212856).
Almost surely, 210142130230434 is an apocalyptic number.
10142130230434 is a deficient number, since it is larger than the sum of its proper divisors (5285335472414).
10142130230434 is an equidigital number, since it uses as much as digits as its factorization.
10142130230434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71423452400.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 10142130230434 its reverse (43403203124101), we get a palindrome (53545333354535).
The spelling of 10142130230434 in words is "ten trillion, one hundred forty-two billion, one hundred thirty million, two hundred thirty thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •