Base | Representation |
---|---|
bin | 1110001000110001110… |
… | …10000110111011000111 |
3 | 1201102210200210120111110 |
4 | 13010120322012323013 |
5 | 30424303243042333 |
6 | 1011052230540103 |
7 | 50044213664334 |
oct | 7043072067307 |
9 | 1642720716443 |
10 | 485749190343 |
11 | 17800683325a |
12 | 7a184507633 |
13 | 36a628a4b21 |
14 | 197206dd98b |
15 | c97e9ab063 |
hex | 7118e86ec7 |
485749190343 has 8 divisors (see below), whose sum is σ = 649127587968. Its totient is φ = 323101793144.
The previous prime is 485749190323. The next prime is 485749190363. The reversal of 485749190343 is 343091947584.
It is a happy number.
485749190343 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (485749190323) and next prime (485749190363).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 485749190343 - 218 = 485748928199 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485749190323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 182748555 + ... + 182751212.
It is an arithmetic number, because the mean of its divisors is an integer number (81140948496).
Almost surely, 2485749190343 is an apocalyptic number.
485749190343 is a deficient number, since it is larger than the sum of its proper divisors (163378397625).
485749190343 is a wasteful number, since it uses less digits than its factorization.
485749190343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365500213.
The product of its (nonzero) digits is 13063680, while the sum is 57.
The spelling of 485749190343 in words is "four hundred eighty-five billion, seven hundred forty-nine million, one hundred ninety thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •