Base | Representation |
---|---|
bin | 100000100101010011011101… |
… | …110011110110101110111011 |
3 | 200210101102221210100102212110 |
4 | 200211103131303312232323 |
5 | 122240320432104101021 |
6 | 1224435324132143403 |
7 | 42120104423152305 |
oct | 4045233563665673 |
9 | 623342853312773 |
10 | 143301010222011 |
11 | 41729687469a44 |
12 | 140a4842467b63 |
13 | 61c62c5447cb5 |
14 | 2755b3d574975 |
15 | 11878c4e3e476 |
hex | 8254ddcf6bbb |
143301010222011 has 32 divisors (see below), whose sum is σ = 195037236460800. Its totient is φ = 93561605424000.
The previous prime is 143301010221989. The next prime is 143301010222031. The reversal of 143301010222011 is 110222010103341.
It is not a de Polignac number, because 143301010222011 - 27 = 143301010221883 is a prime.
It is a super-2 number, since 2×1433010102220112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (143301010222031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1425816261 + ... + 1425916761.
It is an arithmetic number, because the mean of its divisors is an integer number (6094913639400).
Almost surely, 2143301010222011 is an apocalyptic number.
143301010222011 is a deficient number, since it is larger than the sum of its proper divisors (51736226238789).
143301010222011 is a wasteful number, since it uses less digits than its factorization.
143301010222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130779.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 143301010222011 its reverse (110222010103341), we get a palindrome (253523020325352).
The spelling of 143301010222011 in words is "one hundred forty-three trillion, three hundred one billion, ten million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.589 sec. • engine limits •