Base | Representation |
---|---|
bin | 1000001001111111001… |
… | …1011101100101001010 |
3 | 111101200012112121001100 |
4 | 2002133303131211022 |
5 | 4243431211140242 |
6 | 144211550202230 |
7 | 13060206346461 |
oct | 2023763354512 |
9 | 441605477040 |
10 | 140120021322 |
11 | 5447410aa16 |
12 | 231a5ab3376 |
13 | 102a06c5828 |
14 | 6ad35519d8 |
15 | 39a152d54c |
hex | 209fcdd94a |
140120021322 has 24 divisors (see below), whose sum is σ = 303780730500. Its totient is φ = 46677850560.
The previous prime is 140120021309. The next prime is 140120021323. The reversal of 140120021322 is 223120021041.
It is a happy number.
140120021322 is a `hidden beast` number, since 140 + 1 + 200 + 2 + 1 + 322 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 134741119041 + 5378902281 = 367071^2 + 73341^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 140120021295 and 140120021304.
It is not an unprimeable number, because it can be changed into a prime (140120021323) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2371947 + ... + 2430302.
Almost surely, 2140120021322 is an apocalyptic number.
140120021322 is an abundant number, since it is smaller than the sum of its proper divisors (163660709178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140120021322 is a wasteful number, since it uses less digits than its factorization.
140120021322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4803878 (or 4803875 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 140120021322 its reverse (223120021041), we get a palindrome (363240042363).
The spelling of 140120021322 in words is "one hundred forty billion, one hundred twenty million, twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •