Base | Representation |
---|---|
bin | 11101111110111100001… |
… | …01010111010101110110 |
3 | 10122111012000120121110010 |
4 | 32333132011113111312 |
5 | 113334344110211042 |
6 | 2105140013041050 |
7 | 134300614064400 |
oct | 16773605272566 |
9 | 3574160517403 |
10 | 1030223132022 |
11 | 367a08111357 |
12 | 1477b7786186 |
13 | 761c3956b06 |
14 | 37c12375b70 |
15 | 1bbe9c6859c |
hex | efde157576 |
1030223132022 has 48 divisors (see below), whose sum is σ = 2397257372160. Its totient is φ = 294298904592.
The previous prime is 1030223132017. The next prime is 1030223132041. The reversal of 1030223132022 is 2202313220301.
It is a happy number.
It is a super-2 number, since 2×10302231320222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1030223132022.
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, 1430403 + ... + 2026449.
It is an arithmetic number, because the mean of its divisors is an integer number (49942861920).
Almost surely, 21030223132022 is an apocalyptic number.
1030223132022 is an abundant number, since it is smaller than the sum of its proper divisors (1367034240138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030223132022 is a wasteful number, since it uses less digits than its factorization.
1030223132022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601945 (or 601938 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 1030223132022 its reverse (2202313220301), we get a palindrome (3232536352323).
The spelling of 1030223132022 in words is "one trillion, thirty billion, two hundred twenty-three million, one hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •