Base | Representation |
---|---|
bin | 1010100111010101111000… |
… | …10101011110110001011111 |
3 | 10001122110210221201021022112 |
4 | 11103222330111132301133 |
5 | 11024413420040043033 |
6 | 121351101114304235 |
7 | 4626255550425035 |
oct | 523527425366137 |
9 | 101573727637275 |
10 | 23342012034143 |
11 | 748a3232a5090 |
12 | 274ba0872807b |
13 | 10041b07c382a |
14 | 5a9a8bb72555 |
15 | 2a72a520dc48 |
hex | 153abc55ec5f |
23342012034143 has 16 divisors (see below), whose sum is σ = 26667068921856. Its totient is φ = 20224125889440.
The previous prime is 23342012034139. The next prime is 23342012034151. The reversal of 23342012034143 is 34143021024332.
It is not a de Polignac number, because 23342012034143 - 22 = 23342012034139 is a prime.
It is a super-3 number, since 3×233420120341433 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23342012034113) 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, 166465871 + ... + 166606032.
It is an arithmetic number, because the mean of its divisors is an integer number (1666691807616).
Almost surely, 223342012034143 is an apocalyptic number.
23342012034143 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
23342012034143 is a deficient number, since it is larger than the sum of its proper divisors (3325056887713).
23342012034143 is a wasteful number, since it uses less digits than its factorization.
23342012034143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333072214.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 23342012034143 its reverse (34143021024332), we get a palindrome (57485033058475).
The spelling of 23342012034143 in words is "twenty-three trillion, three hundred forty-two billion, twelve million, thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •