Base | Representation |
---|---|
bin | 1101101101100011001… |
… | …00110001000101011010 |
3 | 1200001001220102022101000 |
4 | 12312301210301011122 |
5 | 30204333421000410 |
6 | 1000233500405430 |
7 | 46016025241221 |
oct | 6666144610532 |
9 | 1601056368330 |
10 | 471130640730 |
11 | 171894a675a2 |
12 | 77384846876 |
13 | 355730a4179 |
14 | 18b35011cb8 |
15 | c3c63e3dc0 |
hex | 6db193115a |
471130640730 has 128 divisors (see below), whose sum is σ = 1266338707200. Its totient is φ = 124637184000.
The previous prime is 471130640711. The next prime is 471130640797. The reversal of 471130640730 is 37046031174.
471130640730 is a `hidden beast` number, since 4 + 7 + 1 + 1 + 3 + 0 + 640 + 7 + 3 + 0 = 666.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 60081610 + ... + 60089450.
It is an arithmetic number, because the mean of its divisors is an integer number (9893271150).
Almost surely, 2471130640730 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 471130640730, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (633169353600).
471130640730 is an abundant number, since it is smaller than the sum of its proper divisors (795208066470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
471130640730 is a wasteful number, since it uses less digits than its factorization.
471130640730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9597 (or 9591 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 36.
The spelling of 471130640730 in words is "four hundred seventy-one billion, one hundred thirty million, six hundred forty thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •