Base | Representation |
---|---|
bin | 10100011110010001011… |
… | …000111111010110000011 |
3 | 11222111102211102120110122 |
4 | 110132101120333112003 |
5 | 141022304222144102 |
6 | 2554152403250455 |
7 | 203434063613204 |
oct | 24362130772603 |
9 | 4874384376418 |
10 | 1406893553027 |
11 | 4a2729807756 |
12 | 1a87b9979a2b |
13 | a2891b4ca31 |
14 | 4c145d775ab |
15 | 268e344e0a2 |
hex | 1479163f583 |
1406893553027 has 8 divisors (see below), whose sum is σ = 1433585318880. Its totient is φ = 1380452414400.
The previous prime is 1406893552991. The next prime is 1406893553041. The reversal of 1406893553027 is 7203553986041.
It is a happy number.
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 1406893553027 - 216 = 1406893487491 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1406893553027.
It is not an unprimeable number, because it can be changed into a prime (1406893553047) 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, 62645474 + ... + 62667927.
It is an arithmetic number, because the mean of its divisors is an integer number (179198164860).
It is a 1-persistent number, because it is pandigital, but 2⋅1406893553027 = 2813787106054 is not.
Almost surely, 21406893553027 is an apocalyptic number.
1406893553027 is a deficient number, since it is larger than the sum of its proper divisors (26691765853).
1406893553027 is a wasteful number, since it uses less digits than its factorization.
1406893553027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125313613.
The product of its (nonzero) digits is 5443200, while the sum is 53.
The spelling of 1406893553027 in words is "one trillion, four hundred six billion, eight hundred ninety-three million, five hundred fifty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •