Base | Representation |
---|---|
bin | 101011111011010… |
… | …1111011110111001 |
3 | 10210201112100001112 |
4 | 1113312233132321 |
5 | 11004313434212 |
6 | 402132130105 |
7 | 51345343652 |
oct | 12766573671 |
9 | 3721470045 |
10 | 1473968057 |
11 | 697020021 |
12 | 351766935 |
13 | 1a64a9463 |
14 | dda88529 |
15 | 89606422 |
hex | 57daf7b9 |
1473968057 has 4 divisors (see below), whose sum is σ = 1474292880. Its totient is φ = 1473643236.
The previous prime is 1473968053. The next prime is 1473968077. The reversal of 1473968057 is 7508693741.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 7508693741 = 523 ⋅14356967.
It is a cyclic number.
It is not a de Polignac number, because 1473968057 - 22 = 1473968053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1473967996 and 1473968014.
It is not an unprimeable number, because it can be changed into a prime (1473968053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 155507 + ... + 164712.
It is an arithmetic number, because the mean of its divisors is an integer number (368573220).
Almost surely, 21473968057 is an apocalyptic number.
It is an amenable number.
1473968057 is a deficient number, since it is larger than the sum of its proper divisors (324823).
1473968057 is an equidigital number, since it uses as much as digits as its factorization.
1473968057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324822.
The product of its (nonzero) digits is 1270080, while the sum is 50.
The square root of 1473968057 is about 38392.2916351707. The cubic root of 1473968057 is about 1138.0535310555.
The spelling of 1473968057 in words is "one billion, four hundred seventy-three million, nine hundred sixty-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •