Base | Representation |
---|---|
bin | 10111001100110000111010… |
… | …011010100101101010001101 |
3 | 111101021012000001200002211021 |
4 | 113030300322122211222031 |
5 | 101333143443110213201 |
6 | 1001000542313154141 |
7 | 30330404414561410 |
oct | 2714607232455215 |
9 | 441235001602737 |
10 | 102032223132301 |
11 | 2a568693a90210 |
12 | b53a6410bb951 |
13 | 44c179c512ab7 |
14 | 1b2a559089b77 |
15 | bbe15b661ea1 |
hex | 5ccc3a6a5a8d |
102032223132301 has 16 divisors (see below), whose sum is σ = 127209348190080. Its totient is φ = 79505414210880.
The previous prime is 102032223132293. The next prime is 102032223132317. The reversal of 102032223132301 is 103231322230201.
It is not a de Polignac number, because 102032223132301 - 23 = 102032223132293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102032223135301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30823635 + ... + 33972943.
It is an arithmetic number, because the mean of its divisors is an integer number (7950584261880).
Almost surely, 2102032223132301 is an apocalyptic number.
102032223132301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102032223132301 is a deficient number, since it is larger than the sum of its proper divisors (25177125057779).
102032223132301 is a wasteful number, since it uses less digits than its factorization.
102032223132301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3570084.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 102032223132301 its reverse (103231322230201), we get a palindrome (205263545362502).
The spelling of 102032223132301 in words is "one hundred two trillion, thirty-two billion, two hundred twenty-three million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •