Base | Representation |
---|---|
bin | 11010100111100100110… |
… | …10010011110110000011 |
3 | 10020102202001100110201211 |
4 | 31103302122103312003 |
5 | 104441100103100201 |
6 | 1540054513110551 |
7 | 123035433104062 |
oct | 15236232236603 |
9 | 3212661313654 |
10 | 914600050051 |
11 | 322974980566 |
12 | 129309858457 |
13 | 683284b058c |
14 | 323a445a1d9 |
15 | 18bce18c651 |
hex | d4f2693d83 |
914600050051 has 16 divisors (see below), whose sum is σ = 967598051328. Its totient is φ = 863203579200.
The previous prime is 914600050037. The next prime is 914600050097. The reversal of 914600050051 is 150050006419.
It is not a de Polignac number, because 914600050051 - 221 = 914597952899 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 914600049995 and 914600050022.
It is not an unprimeable number, because it can be changed into a prime (914600750051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 696730 + ... + 1521391.
It is an arithmetic number, because the mean of its divisors is an integer number (60474878208).
Almost surely, 2914600050051 is an apocalyptic number.
914600050051 is a deficient number, since it is larger than the sum of its proper divisors (52998001277).
914600050051 is a wasteful number, since it uses less digits than its factorization.
914600050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2218482.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 914600050051 in words is "nine hundred fourteen billion, six hundred million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •