Base | Representation |
---|---|
bin | 1001000010100001… |
… | …11111000100010011 |
3 | 110112012220101211011 |
4 | 10201100333010103 |
5 | 34414341134201 |
6 | 2121322031351 |
7 | 231156253306 |
oct | 44120770423 |
9 | 13465811734 |
10 | 4853068051 |
11 | 2070480947 |
12 | b35348557 |
13 | 5c4595300 |
14 | 340774b3d |
15 | 1d60d1151 |
hex | 12143f113 |
4853068051 has 24 divisors (see below), whose sum is σ = 5324368896. Its totient is φ = 4421121120.
The previous prime is 4853068019. The next prime is 4853068063. The reversal of 4853068051 is 1508603584.
It is not a de Polignac number, because 4853068051 - 25 = 4853068019 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4853067995 and 4853068013.
It is not an unprimeable number, because it can be changed into a prime (4853068951) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4936506 + ... + 4937488.
It is an arithmetic number, because the mean of its divisors is an integer number (221848704).
Almost surely, 24853068051 is an apocalyptic number.
4853068051 is a deficient number, since it is larger than the sum of its proper divisors (471300845).
4853068051 is a wasteful number, since it uses less digits than its factorization.
4853068051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1363 (or 1350 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 40.
The square root of 4853068051 is about 69663.9652259330. The cubic root of 4853068051 is about 1693.0591337598.
The spelling of 4853068051 in words is "four billion, eight hundred fifty-three million, sixty-eight thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •