Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …000101011111100011000111 |
3 | 111101012011020202200100200022 |
4 | 113030131022011133203013 |
5 | 101332322022331414343 |
6 | 1000543113412005355 |
7 | 30326023645254635 |
oct | 2714351205374307 |
9 | 441164222610608 |
10 | 102011011201223 |
11 | 2a55a699446463 |
12 | b53650130085b |
13 | 44bc79ba271a7 |
14 | 1b29505c4a355 |
15 | bbd819300568 |
hex | 5cc74a15f8c7 |
102011011201223 has 8 divisors (see below), whose sum is σ = 108012279317040. Its totient is φ = 96009812018560.
The previous prime is 102011011201207. The next prime is 102011011201247. The reversal of 102011011201223 is 322102110110201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102011011201223 - 24 = 102011011201207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011011201423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14170973 + ... + 20120598.
It is an arithmetic number, because the mean of its divisors is an integer number (13501534914630).
Almost surely, 2102011011201223 is an apocalyptic number.
102011011201223 is a deficient number, since it is larger than the sum of its proper divisors (6001268115817).
102011011201223 is a wasteful number, since it uses less digits than its factorization.
102011011201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34466577.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 102011011201223 its reverse (322102110110201), we get a palindrome (424113121311424).
The spelling of 102011011201223 in words is "one hundred two trillion, eleven billion, eleven million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •