Base | Representation |
---|---|
bin | 1000010101110111110… |
… | …0010000111110010111 |
3 | 111200220112001022011122 |
4 | 2011131330100332113 |
5 | 4321444330000043 |
6 | 145500302354155 |
7 | 13232232621101 |
oct | 2053574207627 |
9 | 450815038148 |
10 | 143310000023 |
11 | 55860839153 |
12 | 2393628b95b |
13 | 1068b565ba8 |
14 | 6d1708c571 |
15 | 3adb5ec368 |
hex | 215df10f97 |
143310000023 has 8 divisors (see below), whose sum is σ = 144358682160. Its totient is φ = 142265070720.
The previous prime is 143310000011. The next prime is 143310000061. The reversal of 143310000023 is 320000013341.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 143310000023 - 226 = 143242891159 is a prime.
It is a super-2 number, since 2×1433100000232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143309999956 and 143310000010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143310500023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 861533 + ... + 1014326.
It is an arithmetic number, because the mean of its divisors is an integer number (18044835270).
Almost surely, 2143310000023 is an apocalyptic number.
143310000023 is a deficient number, since it is larger than the sum of its proper divisors (1048682137).
143310000023 is a wasteful number, since it uses less digits than its factorization.
143310000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1876417.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 143310000023 its reverse (320000013341), we get a palindrome (463310013364).
The spelling of 143310000023 in words is "one hundred forty-three billion, three hundred ten million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •