Base | Representation |
---|---|
bin | 10010110110011100… |
… | …11101100101011001 |
3 | 222010022102020210220 |
4 | 21123032131211121 |
5 | 131211313434231 |
6 | 4352124230253 |
7 | 505536266151 |
oct | 113316354531 |
9 | 28108366726 |
10 | 10120452441 |
11 | 4323805790 |
12 | 1b6539b389 |
13 | c539422c8 |
14 | 6c0159761 |
15 | 3e3752896 |
hex | 25b39d959 |
10120452441 has 8 divisors (see below), whose sum is σ = 14720658144. Its totient is φ = 6133607520.
The previous prime is 10120452439. The next prime is 10120452473. The reversal of 10120452441 is 14425402101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10120452441 - 21 = 10120452439 is a prime.
It is a super-2 number, since 2×101204524412 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10120452421) 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 7 ways as a sum of consecutive naturals, for example, 153340156 + ... + 153340221.
It is an arithmetic number, because the mean of its divisors is an integer number (1840082268).
Almost surely, 210120452441 is an apocalyptic number.
10120452441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10120452441 is a deficient number, since it is larger than the sum of its proper divisors (4600205703).
10120452441 is a wasteful number, since it uses less digits than its factorization.
10120452441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306680391.
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 10120452441 its reverse (14425402101), we get a palindrome (24545854542).
The spelling of 10120452441 in words is "ten billion, one hundred twenty million, four hundred fifty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •