Base | Representation |
---|---|
bin | 1001001110010111011101… |
… | …1010100000011110000110 |
3 | 1022220121100202220000112200 |
4 | 2103211313122200132012 |
5 | 2312133134313121202 |
6 | 33323210342055330 |
7 | 2064523436642544 |
oct | 223456732403606 |
9 | 38817322800480 |
10 | 10142421223302 |
11 | 3260416406055 |
12 | 117980441a546 |
13 | 587570527314 |
14 | 270c78142d94 |
15 | 128c634cde1c |
hex | 939776a0786 |
10142421223302 has 48 divisors (see below), whose sum is σ = 22341187312080. Its totient is φ = 3324536654400.
The previous prime is 10142421223247. The next prime is 10142421223321. The reversal of 10142421223302 is 20332212424101.
10142421223302 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 2 + 421 + 2 + 233 + 0 + 2 = 666.
10142421223302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3141324 + ... + 5491152.
It is an arithmetic number, because the mean of its divisors is an integer number (465441402335).
Almost surely, 210142421223302 is an apocalyptic number.
10142421223302 is an abundant number, since it is smaller than the sum of its proper divisors (12198766088778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10142421223302 is a wasteful number, since it uses less digits than its factorization.
10142421223302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2353829 (or 2353826 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 10142421223302 its reverse (20332212424101), we get a palindrome (30474633647403).
The spelling of 10142421223302 in words is "ten trillion, one hundred forty-two billion, four hundred twenty-one million, two hundred twenty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •