Base | Representation |
---|---|
bin | 11111111011011000100001… |
… | …010101010111001001101001 |
3 | 200102012001010120100112012121 |
4 | 133323120201111113021221 |
5 | 121401121102311222101 |
6 | 1214352054124311241 |
7 | 41402011645405453 |
oct | 3773304125271151 |
9 | 612161116315177 |
10 | 140420220023401 |
11 | 4081897650148a |
12 | 138ba4676a2521 |
13 | 60477541a1916 |
14 | 2696536a8b2d3 |
15 | 11379bb1130a1 |
hex | 7fb621557269 |
140420220023401 has 16 divisors (see below), whose sum is σ = 149453226242064. Its totient is φ = 131473126047744.
The previous prime is 140420220023387. The next prime is 140420220023407. The reversal of 140420220023401 is 104320022024041.
It can be written as a sum of positive squares in 8 ways, for example, as 4201536555225 + 136218683468176 = 2049765^2 + 11671276^2 .
It is a cyclic number.
It is not a de Polignac number, because 140420220023401 - 27 = 140420220023273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140420220023407) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 202856655 + ... + 203547691.
It is an arithmetic number, because the mean of its divisors is an integer number (9340826640129).
Almost surely, 2140420220023401 is an apocalyptic number.
It is an amenable number.
140420220023401 is a deficient number, since it is larger than the sum of its proper divisors (9033006218663).
140420220023401 is a wasteful number, since it uses less digits than its factorization.
140420220023401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 753180.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 140420220023401 its reverse (104320022024041), we get a palindrome (244740242047442).
The spelling of 140420220023401 in words is "one hundred forty trillion, four hundred twenty billion, two hundred twenty million, twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •