Base | Representation |
---|---|
bin | 10010110100100010… |
… | …10100011110001011 |
3 | 222002012020221101012 |
4 | 21122101110132023 |
5 | 131143213034311 |
6 | 4350352514135 |
7 | 505253122031 |
oct | 113221243613 |
9 | 28065227335 |
10 | 10104424331 |
11 | 4315758611 |
12 | 1b5bb4b94b |
13 | c5051ca11 |
14 | 6bbd86551 |
15 | 3e213878b |
hex | 25a45478b |
10104424331 has 8 divisors (see below), whose sum is σ = 10652447904. Its totient is φ = 9565459200.
The previous prime is 10104424307. The next prime is 10104424367. The reversal of 10104424331 is 13342440101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10104424331 is a prime.
It is a super-2 number, since 2×101044243312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10104424297 and 10104424306.
It is not an unprimeable number, because it can be changed into a prime (10104427331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2262320 + ... + 2266781.
It is an arithmetic number, because the mean of its divisors is an integer number (1331555988).
Almost surely, 210104424331 is an apocalyptic number.
10104424331 is a deficient number, since it is larger than the sum of its proper divisors (548023573).
10104424331 is an equidigital number, since it uses as much as digits as its factorization.
10104424331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4529221.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10104424331 its reverse (13342440101), we get a palindrome (23446864432).
The spelling of 10104424331 in words is "ten billion, one hundred four million, four hundred twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •