Base | Representation |
---|---|
bin | 100010001000101… |
… | …1001101001101010 |
3 | 2221211021222011011 |
4 | 1010101121221222 |
5 | 4321211142302 |
6 | 305354054134 |
7 | 40245562114 |
oct | 10421315152 |
9 | 2854258134 |
10 | 1145412202 |
11 | 538612160 |
12 | 27b71a34a |
13 | 1533c0acc |
14 | ac1a03b4 |
15 | 6a8565d7 |
hex | 44459a6a |
1145412202 has 8 divisors (see below), whose sum is σ = 1874310912. Its totient is φ = 520641900.
The previous prime is 1145412197. The next prime is 1145412227. The reversal of 1145412202 is 2022145411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11454122022 = 2623938224980977608, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 52064191 = 1145412202 / (1 + 1 + 4 + 5 + 4 + 1 + 2 + 2 + 0 + 2).
It is an unprimeable number.
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, 26032074 + ... + 26032117.
It is an arithmetic number, because the mean of its divisors is an integer number (234288864).
Almost surely, 21145412202 is an apocalyptic number.
1145412202 is a deficient number, since it is larger than the sum of its proper divisors (728898710).
1145412202 is a wasteful number, since it uses less digits than its factorization.
1145412202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52064204.
The product of its (nonzero) digits is 640, while the sum is 22.
The square root of 1145412202 is about 33843.9389256038. The cubic root of 1145412202 is about 1046.2944824398.
Adding to 1145412202 its reverse (2022145411), we get a palindrome (3167557613).
The spelling of 1145412202 in words is "one billion, one hundred forty-five million, four hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •