Base | Representation |
---|---|
bin | 11111111000010101000111… |
… | …110100000111101011101011 |
3 | 200101102222120200221222011022 |
4 | 133320111013310013223223 |
5 | 121334201411012120321 |
6 | 1214111435115123055 |
7 | 41350603502466011 |
oct | 3770250764075353 |
9 | 611388520858138 |
10 | 140210412223211 |
11 | 407479a14708a0 |
12 | 1388587344348b |
13 | 6030a28c4b0a5 |
14 | 268a3121988b1 |
15 | 11322dbae8dab |
hex | 7f8547d07aeb |
140210412223211 has 16 divisors (see below), whose sum is σ = 161244996572160. Its totient is φ = 120577010467680.
The previous prime is 140210412223157. The next prime is 140210412223253. The reversal of 140210412223211 is 112322214012041.
It is a cyclic number.
It is not a de Polignac number, because 140210412223211 - 214 = 140210412206827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140210415223211) 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, 495326171 + ... + 495609156.
It is an arithmetic number, because the mean of its divisors is an integer number (10077812285760).
Almost surely, 2140210412223211 is an apocalyptic number.
140210412223211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
140210412223211 is a deficient number, since it is larger than the sum of its proper divisors (21034584348949).
140210412223211 is a wasteful number, since it uses less digits than its factorization.
140210412223211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 990936034.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 140210412223211 its reverse (112322214012041), we get a palindrome (252532626235252).
The spelling of 140210412223211 in words is "one hundred forty trillion, two hundred ten billion, four hundred twelve million, two hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •