Base | Representation |
---|---|
bin | 100101110100110… |
… | …1101101000000110 |
3 | 10021110021100202000 |
4 | 1023221231220012 |
5 | 10044410212430 |
6 | 325535530130 |
7 | 43311146214 |
oct | 11351555006 |
9 | 3243240660 |
10 | 1269225990 |
11 | 5a14992aa |
12 | 2b5089946 |
13 | 172c518c6 |
14 | c07cdcb4 |
15 | 76661e60 |
hex | 4ba6da06 |
1269225990 has 32 divisors (see below), whose sum is σ = 3384603360. Its totient is φ = 338460192.
The previous prime is 1269225989. The next prime is 1269226027. The reversal of 1269225990 is 995229621.
It is a super-2 number, since 2×12692259902 = 3221869227382960200, which contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2350149 + ... + 2350688.
It is an arithmetic number, because the mean of its divisors is an integer number (105768855).
Almost surely, 21269225990 is an apocalyptic number.
1269225990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1269225990 is an abundant number, since it is smaller than the sum of its proper divisors (2115377370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1269225990 is a wasteful number, since it uses less digits than its factorization.
1269225990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4700853 (or 4700847 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 45.
The square root of 1269225990 is about 35626.1980851171. The cubic root of 1269225990 is about 1082.7120880446.
The spelling of 1269225990 in words is "one billion, two hundred sixty-nine million, two hundred twenty-five thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •