Base | Representation |
---|---|
bin | 11011111110000101111010… |
… | …010011010111000000001010 |
3 | 121010120001011211002021122120 |
4 | 123332011322103113000022 |
5 | 112110431100304020132 |
6 | 1113343540434432110 |
7 | 34624324543261221 |
oct | 3376057223270012 |
9 | 533501154067576 |
10 | 123014210220042 |
11 | 36218040771599 |
12 | 11968b8a132636 |
13 | 5384261c907ab |
14 | 2253cc3321cb8 |
15 | e34d366a502c |
hex | 6fe17a4d700a |
123014210220042 has 32 divisors (see below), whose sum is σ = 246343698833472. Its totient is φ = 40952217972864.
The previous prime is 123014210220029. The next prime is 123014210220071. The reversal of 123014210220042 is 240022012410321.
123014210220042 is digitally balanced in base 4 and base 13, because in such bases it contains all the possibile digits an equal number of times.
123014210220042 is strictly pandigital in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 123014210219994 and 123014210220021.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14365408 + ... + 21269540.
It is an arithmetic number, because the mean of its divisors is an integer number (7698240588546).
Almost surely, 2123014210220042 is an apocalyptic number.
123014210220042 is an abundant number, since it is smaller than the sum of its proper divisors (123329488613430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123014210220042 is a wasteful number, since it uses less digits than its factorization.
123014210220042 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6907942.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 123014210220042 its reverse (240022012410321), we get a palindrome (363036222630363).
The spelling of 123014210220042 in words is "one hundred twenty-three trillion, fourteen billion, two hundred ten million, two hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •