Base | Representation |
---|---|
bin | 10111001100100111101010… |
… | …111101010001110001110000 |
3 | 111101020020101111202112210010 |
4 | 113030213222331101301300 |
5 | 101333013132312122112 |
6 | 1000552221520334520 |
7 | 30326603463402114 |
oct | 2714475275216160 |
9 | 441206344675703 |
10 | 102022300114032 |
11 | 2a564461775771 |
12 | b538731a74440 |
13 | 44c087a769c5c |
14 | 1b29c97245744 |
15 | bbdc7a40d63c |
hex | 5cc9eaf51c70 |
102022300114032 has 40 divisors (see below), whose sum is σ = 263865143866896. Its totient is φ = 33967751405056.
The previous prime is 102022300113931. The next prime is 102022300114039. The reversal of 102022300114032 is 230411003220201.
It is a super-2 number, since 2×1020223001140322 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102022300114039) 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, 1240019883 + ... + 1240102154.
Almost surely, 2102022300114032 is an apocalyptic number.
102022300114032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102022300114032 is an abundant number, since it is smaller than the sum of its proper divisors (161842843752864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022300114032 is a wasteful number, since it uses less digits than its factorization.
102022300114032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2480122905 (or 2480122899 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 102022300114032 its reverse (230411003220201), we get a palindrome (332433303334233).
The spelling of 102022300114032 in words is "one hundred two trillion, twenty-two billion, three hundred million, one hundred fourteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •