Base | Representation |
---|---|
bin | 1101010001100011100… |
… | …10110110101000011011 |
3 | 1121121021112021121120012 |
4 | 12220301302312220123 |
5 | 24433044044313211 |
6 | 545310315352135 |
7 | 44644426406300 |
oct | 6506162665033 |
9 | 1547245247505 |
10 | 456101947931 |
11 | 166482728223 |
12 | 7448b75264b |
13 | 34019620136 |
14 | 1810b07d0a7 |
15 | bce6d12d8b |
hex | 6a31cb6a1b |
456101947931 has 12 divisors (see below), whose sum is σ = 530940504672. Its totient is φ = 390669734448.
The previous prime is 456101947921. The next prime is 456101947937. The reversal of 456101947931 is 139749101654.
It is not a de Polignac number, because 456101947931 - 26 = 456101947867 is a prime.
It is a super-2 number, since 2×4561019479312 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 456101947931.
It is not an unprimeable number, because it can be changed into a prime (456101947937) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3200900 + ... + 3340353.
It is an arithmetic number, because the mean of its divisors is an integer number (44245042056).
Almost surely, 2456101947931 is an apocalyptic number.
456101947931 is a deficient number, since it is larger than the sum of its proper divisors (74838556741).
456101947931 is a wasteful number, since it uses less digits than its factorization.
456101947931 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6542690 (or 6542683 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 456101947931 in words is "four hundred fifty-six billion, one hundred one million, nine hundred forty-seven thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •