Base | Representation |
---|---|
bin | 10111001100011110010011… |
… | …011101011011010111100010 |
3 | 111101012021102120001012102222 |
4 | 113030132103131123113202 |
5 | 101332332033001243242 |
6 | 1000543435504511042 |
7 | 30326066313552401 |
oct | 2714362335332742 |
9 | 441167376035388 |
10 | 102012242212322 |
11 | 2a560170303302 |
12 | b5367a561b482 |
13 | 44bc936a88920 |
14 | 1b295c152d638 |
15 | bbd88c4145d2 |
hex | 5cc79375b5e2 |
102012242212322 has 32 divisors (see below), whose sum is σ = 166848399048240. Its totient is φ = 46496572243200.
The previous prime is 102012242212297. The next prime is 102012242212379. The reversal of 102012242212322 is 223212242210201.
It is a Cunningham number, because it is equal to 101001112+1.
It can be written as a sum of positive squares in 8 ways, for example, as 24081112377001 + 77931129835321 = 4907251^2 + 8827861^2 .
It is a super-2 number, since 2×1020122422123222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 102012242212291 and 102012242212300.
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, 48910373 + ... + 50953400.
Almost surely, 2102012242212322 is an apocalyptic number.
102012242212322 is a deficient number, since it is larger than the sum of its proper divisors (64836156835918).
102012242212322 is a wasteful number, since it uses less digits than its factorization.
102012242212322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99864278.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 102012242212322 its reverse (223212242210201), we get a palindrome (325224484422523).
The spelling of 102012242212322 in words is "one hundred two trillion, twelve billion, two hundred forty-two million, two hundred twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •