Base | Representation |
---|---|
bin | 100100100010011… |
… | …0110010011110000 |
3 | 10011102221122112000 |
4 | 1021010312103300 |
5 | 10002324222132 |
6 | 321353334000 |
7 | 42244615512 |
oct | 11104662360 |
9 | 3142848460 |
10 | 1226007792 |
11 | 57a05a889 |
12 | 2a2707300 |
13 | 166ccc2c9 |
14 | b8b7dbb2 |
15 | 7297687c |
hex | 491364f0 |
1226007792 has 40 divisors (see below), whose sum is σ = 3519097680. Its totient is φ = 408669120.
The previous prime is 1226007779. The next prime is 1226007793. The reversal of 1226007792 is 2977006221.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1226007793) 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 7 ways as a sum of consecutive naturals, for example, 1418559 + ... + 1419422.
It is an arithmetic number, because the mean of its divisors is an integer number (87977442).
Almost surely, 21226007792 is an apocalyptic number.
1226007792 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1226007792 is an abundant number, since it is smaller than the sum of its proper divisors (2293089888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1226007792 is a wasteful number, since it uses less digits than its factorization.
1226007792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2837998 (or 2837986 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The square root of 1226007792 is about 35014.3940687255. The cubic root of 1226007792 is about 1070.2808218576.
The spelling of 1226007792 in words is "one billion, two hundred twenty-six million, seven thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •