Base | Representation |
---|---|
bin | 1011111100011000… |
… | …11111110000001100 |
3 | 121112212122002202222 |
4 | 11332030133300030 |
5 | 101113004003200 |
6 | 2540135034512 |
7 | 314620364612 |
oct | 57614376014 |
9 | 17485562688 |
10 | 6412172300 |
11 | 27a055aa56 |
12 | 12ab50ba38 |
13 | 7b25ac8c1 |
14 | 44b8616b2 |
15 | 277e02d85 |
hex | 17e31fc0c |
6412172300 has 72 divisors (see below), whose sum is σ = 14660894976. Its totient is φ = 2429444160.
The previous prime is 6412172297. The next prime is 6412172317. The reversal of 6412172300 is 32712146.
It is a super-2 number, since 2×64121723002 = 82231907209774580000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6412172300.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 223367 + ... + 250433.
Almost surely, 26412172300 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 6412172300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7330447488).
6412172300 is an abundant number, since it is smaller than the sum of its proper divisors (8248722676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6412172300 is a wasteful number, since it uses less digits than its factorization.
6412172300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27207 (or 27200 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 6412172300 is about 80076.0407362902. The cubic root of 6412172300 is about 1857.8118465864.
Adding to 6412172300 its reverse (32712146), we get a palindrome (6444884446).
The spelling of 6412172300 in words is "six billion, four hundred twelve million, one hundred seventy-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •