Base | Representation |
---|---|
bin | 111010100001001110110… |
… | …110100000110100101011 |
3 | 112020102222010201100110221 |
4 | 322201032312200310223 |
5 | 1011341323022131443 |
6 | 12315224501550511 |
7 | 563352226400656 |
oct | 72411666406453 |
9 | 15212863640427 |
10 | 4021412302123 |
11 | 1310520452127 |
12 | 54b462a15437 |
13 | 2322a9c6b4a8 |
14 | dc8cd01a89d |
15 | 6e915beaeed |
hex | 3a84eda0d2b |
4021412302123 has 4 divisors (see below), whose sum is σ = 4052110106088. Its totient is φ = 3990714498160.
The previous prime is 4021412302111. The next prime is 4021412302163. The reversal of 4021412302123 is 3212032141204.
4021412302123 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4021412302123 - 213 = 4021412293931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4021412302163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15348901786 + ... + 15348902047.
It is an arithmetic number, because the mean of its divisors is an integer number (1013027526522).
Almost surely, 24021412302123 is an apocalyptic number.
4021412302123 is a deficient number, since it is larger than the sum of its proper divisors (30697803965).
4021412302123 is a wasteful number, since it uses less digits than its factorization.
4021412302123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30697803964.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4021412302123 its reverse (3212032141204), we get a palindrome (7233444443327).
The spelling of 4021412302123 in words is "four trillion, twenty-one billion, four hundred twelve million, three hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •