Base | Representation |
---|---|
bin | 111010110100110010100… |
… | …010110011011101100111 |
3 | 112022110011122202012111121 |
4 | 322310302202303131213 |
5 | 1012212330011210043 |
6 | 12333020350514411 |
7 | 565024512563155 |
oct | 72646242633547 |
9 | 15273148665447 |
10 | 4042412210023 |
11 | 1319417341810 |
12 | 553543805a07 |
13 | 2342758503b5 |
14 | dd9220283d5 |
15 | 7024462aded |
hex | 3ad328b3767 |
4042412210023 has 16 divisors (see below), whose sum is σ = 4493453546016. Its totient is φ = 3605306365440.
The previous prime is 4042412210021. The next prime is 4042412210041. The reversal of 4042412210023 is 3200122142404.
It is a cyclic number.
It is not a de Polignac number, because 4042412210023 - 21 = 4042412210021 is a prime.
It is a super-3 number, since 3×40424122100233 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4042412210023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4042412210021) 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, 7563715 + ... + 8080507.
It is an arithmetic number, because the mean of its divisors is an integer number (280840846626).
Almost surely, 24042412210023 is an apocalyptic number.
4042412210023 is a deficient number, since it is larger than the sum of its proper divisors (451041335993).
4042412210023 is a wasteful number, since it uses less digits than its factorization.
4042412210023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530274.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 4042412210023 its reverse (3200122142404), we get a palindrome (7242534352427).
The spelling of 4042412210023 in words is "four trillion, forty-two billion, four hundred twelve million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •