Base | Representation |
---|---|
bin | 1001110000010001001000… |
… | …1010010101110010100010 |
3 | 1101222021200101212202020012 |
4 | 2130010102022111302202 |
5 | 2401203432014214230 |
6 | 34450531135444522 |
7 | 2154562325123636 |
oct | 234042212256242 |
9 | 41867611782205 |
10 | 10724838038690 |
11 | 3465418527816 |
12 | 1252666686742 |
13 | 5ca46a402579 |
14 | 29112909adc6 |
15 | 138e9e879395 |
hex | 9c112295ca2 |
10724838038690 has 32 divisors (see below), whose sum is σ = 20485468114560. Its totient is φ = 4033866859264.
The previous prime is 10724838038671. The next prime is 10724838038699. The reversal of 10724838038690 is 9683083842701.
It is a happy number.
It is a super-2 number, since 2×107248380386902 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (59).
It is not an unprimeable number, because it can be changed into a prime (10724838038699) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 395153639 + ... + 395180778.
It is an arithmetic number, because the mean of its divisors is an integer number (640170878580).
Almost surely, 210724838038690 is an apocalyptic number.
10724838038690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10724838038690 is a deficient number, since it is larger than the sum of its proper divisors (9760630075870).
10724838038690 is a wasteful number, since it uses less digits than its factorization.
10724838038690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790334506.
The product of its (nonzero) digits is 13934592, while the sum is 59.
The spelling of 10724838038690 in words is "ten trillion, seven hundred twenty-four billion, eight hundred thirty-eight million, thirty-eight thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •