Base | Representation |
---|---|
bin | 1001010100000101010101… |
… | …0011011110101011001001 |
3 | 1100020222212100001112121002 |
4 | 2111001111103132223021 |
5 | 2320240304100002101 |
6 | 33440252033424345 |
7 | 2104601303001206 |
oct | 225012523365311 |
9 | 40228770045532 |
10 | 10240633203401 |
11 | 329903451a357 |
12 | 119485340b0b5 |
13 | 5938c277c903 |
14 | 275913928cad |
15 | 12b5b0779d6b |
hex | 950554deac9 |
10240633203401 has 4 divisors (see below), whose sum is σ = 10685878125312. Its totient is φ = 9795388281492.
The previous prime is 10240633203397. The next prime is 10240633203481. The reversal of 10240633203401 is 10430233604201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10240633203401 - 22 = 10240633203397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10240633203481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 222622460921 + ... + 222622460966.
It is an arithmetic number, because the mean of its divisors is an integer number (2671469531328).
Almost surely, 210240633203401 is an apocalyptic number.
It is an amenable number.
10240633203401 is a deficient number, since it is larger than the sum of its proper divisors (445244921911).
10240633203401 is an equidigital number, since it uses as much as digits as its factorization.
10240633203401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445244921910.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 10240633203401 its reverse (10430233604201), we get a palindrome (20670866807602).
The spelling of 10240633203401 in words is "ten trillion, two hundred forty billion, six hundred thirty-three million, two hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •