Base | Representation |
---|---|
bin | 100100100011110… |
… | …0101110000101000 |
3 | 10011111022011022121 |
4 | 1021013211300220 |
5 | 10003020221230 |
6 | 321421001024 |
7 | 42254000632 |
oct | 11107456050 |
9 | 3144264277 |
10 | 1226726440 |
11 | 57a500805 |
12 | 2a29b3174 |
13 | 1671c1444 |
14 | b8cc9a52 |
15 | 72a6977a |
hex | 491e5c28 |
1226726440 has 16 divisors (see below), whose sum is σ = 2760134580. Its totient is φ = 490690560.
The previous prime is 1226726429. The next prime is 1226726447. The reversal of 1226726440 is 446276221.
It can be written as a sum of positive squares in 2 ways, for example, as 1200899716 + 25826724 = 34654^2 + 5082^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1226726396 and 1226726405.
It is not an unprimeable number, because it can be changed into a prime (1226726447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15334041 + ... + 15334120.
Almost surely, 21226726440 is an apocalyptic number.
1226726440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1226726440 is an abundant number, since it is smaller than the sum of its proper divisors (1533408140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1226726440 is a wasteful number, since it uses less digits than its factorization.
1226726440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30668172 (or 30668168 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 34.
The square root of 1226726440 is about 35024.6547449079. The cubic root of 1226726440 is about 1070.4899028931.
The spelling of 1226726440 in words is "one billion, two hundred twenty-six million, seven hundred twenty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •