Base | Representation |
---|---|
bin | 101001110000011… |
… | …1110101000001000 |
3 | 10121122112000000200 |
4 | 1103200332220020 |
5 | 10332143412211 |
6 | 351011332200 |
7 | 46502420151 |
oct | 12340765010 |
9 | 3548460020 |
10 | 1401154056 |
11 | 659a07865 |
12 | 3312b1060 |
13 | 194393b53 |
14 | d4132928 |
15 | 83021b56 |
hex | 5383ea08 |
1401154056 has 48 divisors (see below), whose sum is σ = 3837447900. Its totient is φ = 461801472.
The previous prime is 1401154021. The next prime is 1401154063. The reversal of 1401154056 is 6504511041.
1401154056 is a `hidden beast` number, since 140 + 115 + 405 + 6 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1372702500 + 28451556 = 37050^2 + 5334^2 .
It is a super-3 number, since 3×14011540563 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 102921 + ... + 115736.
Almost surely, 21401154056 is an apocalyptic number.
It is an amenable number.
1401154056 is an abundant number, since it is smaller than the sum of its proper divisors (2436293844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1401154056 is a wasteful number, since it uses less digits than its factorization.
1401154056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218758 (or 218751 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 1401154056 is about 37431.9924129080. The cubic root of 1401154056 is about 1118.9962456779.
Adding to 1401154056 its reverse (6504511041), we get a palindrome (7905665097).
The spelling of 1401154056 in words is "one billion, four hundred one million, one hundred fifty-four thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •