Base | Representation |
---|---|
bin | 100011111100101… |
… | …0010011101011100 |
3 | 10010001200022112212 |
4 | 1013321102131130 |
5 | 4432241401111 |
6 | 315405015552 |
7 | 41614350350 |
oct | 10771223534 |
9 | 3101608485 |
10 | 1206200156 |
11 | 569961037 |
12 | 297b545b8 |
13 | 162b85605 |
14 | b62a5460 |
15 | 70d6298b |
hex | 47e5275c |
1206200156 has 48 divisors (see below), whose sum is σ = 2501210880. Its totient is φ = 498218880.
The previous prime is 1206200137. The next prime is 1206200207. The reversal of 1206200156 is 6510026021.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88955 + ... + 101613.
It is an arithmetic number, because the mean of its divisors is an integer number (52108560).
Almost surely, 21206200156 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1206200156, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1250605440).
1206200156 is an abundant number, since it is smaller than the sum of its proper divisors (1295010724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1206200156 is a wasteful number, since it uses less digits than its factorization.
1206200156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12794 (or 12792 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1206200156 is about 34730.3923962860. The cubic root of 1206200156 is about 1064.4856063940.
Adding to 1206200156 its reverse (6510026021), we get a palindrome (7716226177).
The spelling of 1206200156 in words is "one billion, two hundred six million, two hundred thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •