Base | Representation |
---|---|
bin | 100011100111100110110… |
… | …0010100000011010001010 |
3 | 122022222220222002210212210 |
4 | 1013033031202200122022 |
5 | 1120201303012000231 |
6 | 14224531221045550 |
7 | 1013452655330565 |
oct | 107171542403212 |
9 | 18288828083783 |
10 | 4895416125066 |
11 | 1618152863375 |
12 | 670920b568b6 |
13 | 2968359c1cbc |
14 | 12cd21a254dc |
15 | 8751ad7ba46 |
hex | 473cd8a068a |
4895416125066 has 16 divisors (see below), whose sum is σ = 9795634056000. Its totient is φ = 1631005074048.
The previous prime is 4895416125053. The next prime is 4895416125091. The reversal of 4895416125066 is 6605216145984.
It is a junction number, because it is equal to n+sod(n) for n = 4895416124997 and 4895416125015.
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 7 ways as a sum of consecutive naturals, for example, 200061991 + ... + 200086458.
It is an arithmetic number, because the mean of its divisors is an integer number (612227128500).
Almost surely, 24895416125066 is an apocalyptic number.
4895416125066 is an abundant number, since it is smaller than the sum of its proper divisors (4900217930934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4895416125066 is a wasteful number, since it uses less digits than its factorization.
4895416125066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400150493.
The product of its (nonzero) digits is 12441600, while the sum is 57.
The spelling of 4895416125066 in words is "four trillion, eight hundred ninety-five billion, four hundred sixteen million, one hundred twenty-five thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •