Base | Representation |
---|---|
bin | 110001100110111001… |
… | …1111001101111111110 |
3 | 101011222102000221212012 |
4 | 1203031303321233332 |
5 | 3221134212302040 |
6 | 120535025411222 |
7 | 10460652223250 |
oct | 1431563715776 |
9 | 334872027765 |
10 | 106532150270 |
11 | 411a86922a7 |
12 | 18791499b12 |
13 | a079c09210 |
14 | 52287d3cd0 |
15 | 2b8793b865 |
hex | 18cdcf9bfe |
106532150270 has 32 divisors (see below), whose sum is σ = 236009688768. Its totient is φ = 33715669248.
The previous prime is 106532150261. The next prime is 106532150297. The reversal of 106532150270 is 72051235601.
It is a super-2 number, since 2×1065321502702 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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, 58533239 + ... + 58535058.
It is an arithmetic number, because the mean of its divisors is an integer number (7375302774).
Almost surely, 2106532150270 is an apocalyptic number.
106532150270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106532150270 is an abundant number, since it is smaller than the sum of its proper divisors (129477538498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106532150270 is a wasteful number, since it uses less digits than its factorization.
106532150270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117068324.
The product of its (nonzero) digits is 12600, while the sum is 32.
Adding to 106532150270 its reverse (72051235601), we get a palindrome (178583385871).
The spelling of 106532150270 in words is "one hundred six billion, five hundred thirty-two million, one hundred fifty thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •