Base | Representation |
---|---|
bin | 101000010101101110… |
… | …101110001100010011 |
3 | 11010210122101111021011 |
4 | 220111232232030103 |
5 | 1202201421223243 |
6 | 31522010311351 |
7 | 3062236661602 |
oct | 502556561423 |
9 | 133718344234 |
10 | 43314242323 |
11 | 17407840390 |
12 | 8489a28557 |
13 | 41138b03b1 |
14 | 214c813a39 |
15 | 11d794e89d |
hex | a15bae313 |
43314242323 has 16 divisors (see below), whose sum is σ = 48360888576. Its totient is φ = 38452811040.
The previous prime is 43314242287. The next prime is 43314242329. The reversal of 43314242323 is 32324241334.
It is a happy number.
43314242323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 43314242323 - 217 = 43314111251 is a prime.
It is a super-2 number, since 2×433142423232 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (43314242329) 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, 4471161 + ... + 4480837.
It is an arithmetic number, because the mean of its divisors is an integer number (3022555536).
Almost surely, 243314242323 is an apocalyptic number.
43314242323 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
43314242323 is a deficient number, since it is larger than the sum of its proper divisors (5046646253).
43314242323 is a wasteful number, since it uses less digits than its factorization.
43314242323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19194.
The product of its digits is 41472, while the sum is 31.
Adding to 43314242323 its reverse (32324241334), we get a palindrome (75638483657).
The spelling of 43314242323 in words is "forty-three billion, three hundred fourteen million, two hundred forty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •