Base | Representation |
---|---|
bin | 11100111010001… |
… | …011101100011011 |
3 | 1020210122021112120 |
4 | 130322023230123 |
5 | 1443130424144 |
6 | 120043312323 |
7 | 15006360600 |
oct | 3472135433 |
9 | 1223567476 |
10 | 485014299 |
11 | 229861470 |
12 | 11651b6a3 |
13 | 79639113 |
14 | 485b46a7 |
15 | 2c8a7e19 |
hex | 1ce8bb1b |
485014299 has 48 divisors (see below), whose sum is σ = 849035520. Its totient is φ = 243243840.
The previous prime is 485014249. The next prime is 485014319. The reversal of 485014299 is 992410584.
It is not a de Polignac number, because 485014299 - 219 = 484490011 is a prime.
It is a super-2 number, since 2×4850142992 = 470477740468922802, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 485014299.
It is not an unprimeable number, because it can be changed into a prime (485014249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 41722 + ... + 52064.
It is an arithmetic number, because the mean of its divisors is an integer number (17688240).
Almost surely, 2485014299 is an apocalyptic number.
485014299 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
485014299 is a deficient number, since it is larger than the sum of its proper divisors (364021221).
485014299 is a wasteful number, since it uses less digits than its factorization.
485014299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10400 (or 10393 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 42.
The square root of 485014299 is about 22023.0401852242. The cubic root of 485014299 is about 785.6905219999.
The spelling of 485014299 in words is "four hundred eighty-five million, fourteen thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •