Base | Representation |
---|---|
bin | 10011000110011011… |
… | …00010111101110101 |
3 | 222110122112000120021 |
4 | 21203031202331311 |
5 | 132000113230234 |
6 | 4413312005141 |
7 | 512054134402 |
oct | 114315427565 |
9 | 28418460507 |
10 | 10254430069 |
11 | 43923a40a4 |
12 | 1ba22307b1 |
13 | c75621400 |
14 | 6d3c732a9 |
15 | 4003b99b4 |
hex | 263362f75 |
10254430069 has 6 divisors (see below), whose sum is σ = 11103909666. Its totient is φ = 9465627600.
The previous prime is 10254430051. The next prime is 10254430079. The reversal of 10254430069 is 96003445201.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 1855044 + 10252575025 = 1362^2 + 101255^2 .
It is not a de Polignac number, because 10254430069 - 211 = 10254428021 is a prime.
It is a super-2 number, since 2×102544300692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10254430049) 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 5 ways as a sum of consecutive naturals, for example, 30338382 + ... + 30338719.
It is an arithmetic number, because the mean of its divisors is an integer number (1850651611).
Almost surely, 210254430069 is an apocalyptic number.
It is an amenable number.
10254430069 is a deficient number, since it is larger than the sum of its proper divisors (849479597).
10254430069 is an equidigital number, since it uses as much as digits as its factorization.
10254430069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60677127 (or 60677114 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 34.
The spelling of 10254430069 in words is "ten billion, two hundred fifty-four million, four hundred thirty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •