Base | Representation |
---|---|
bin | 1001000111011110011011… |
… | …0000101001010100110111 |
3 | 1022111021202220022120120020 |
4 | 2101313212300221110313 |
5 | 2303213203213312211 |
6 | 33152550443540223 |
7 | 2053132545652503 |
oct | 221674660512467 |
9 | 38437686276506 |
10 | 10024030213431 |
11 | 3215192803043 |
12 | 115a88352a673 |
13 | 5793537a2a20 |
14 | 269246791303 |
15 | 125b34901306 |
hex | 91de6c29537 |
10024030213431 has 32 divisors (see below), whose sum is σ = 15520568206080. Its totient is φ = 5701433184000.
The previous prime is 10024030213403. The next prime is 10024030213471. The reversal of 10024030213431 is 13431203042001.
It is a happy number.
It is not a de Polignac number, because 10024030213431 - 26 = 10024030213367 is a prime.
It is a super-2 number, since 2×100240302134312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10024030213471) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 164941645 + ... + 165002406.
It is an arithmetic number, because the mean of its divisors is an integer number (485017756440).
Almost surely, 210024030213431 is an apocalyptic number.
10024030213431 is a deficient number, since it is larger than the sum of its proper divisors (5496537992649).
10024030213431 is a wasteful number, since it uses less digits than its factorization.
10024030213431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329944127.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10024030213431 its reverse (13431203042001), we get a palindrome (23455233255432).
The spelling of 10024030213431 in words is "ten trillion, twenty-four billion, thirty million, two hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •