Base | Representation |
---|---|
bin | 10100011110110100001… |
… | …000000010110010101001 |
3 | 11222112221102222212012212 |
4 | 110132310020002302221 |
5 | 141030002414011012 |
6 | 2554330302014505 |
7 | 203454401160500 |
oct | 24366410026251 |
9 | 4875842885185 |
10 | 1407476313257 |
11 | 4a29a8760083 |
12 | 1a8940b77435 |
13 | a29557c0681 |
14 | 4c19d513837 |
15 | 269296b3b22 |
hex | 147b4202ca9 |
1407476313257 has 6 divisors (see below), whose sum is σ = 1637268364458. Its totient is φ = 1206408268464.
The previous prime is 1407476313181. The next prime is 1407476313259. The reversal of 1407476313257 is 7523136747041.
It can be written as a sum of positive squares in only one way, i.e., 1321812389401 + 85663923856 = 1149701^2 + 292684^2 .
It is not a de Polignac number, because 1407476313257 - 214 = 1407476296873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1407476313259) 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 5 ways as a sum of consecutive naturals, for example, 14362003148 + ... + 14362003245.
It is an arithmetic number, because the mean of its divisors is an integer number (272878060743).
Almost surely, 21407476313257 is an apocalyptic number.
It is an amenable number.
1407476313257 is a deficient number, since it is larger than the sum of its proper divisors (229792051201).
1407476313257 is an equidigital number, since it uses as much as digits as its factorization.
1407476313257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28724006407 (or 28724006400 counting only the distinct ones).
The product of its (nonzero) digits is 2963520, while the sum is 50.
The spelling of 1407476313257 in words is "one trillion, four hundred seven billion, four hundred seventy-six million, three hundred thirteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •