Base | Representation |
---|---|
bin | 1110010100001… |
… | …11001010001000 |
3 | 22100222021020220 |
4 | 13022013022020 |
5 | 221220410042 |
6 | 15525550040 |
7 | 2655521220 |
oct | 712071210 |
9 | 270867226 |
10 | 120091272 |
11 | 61874394 |
12 | 34275320 |
13 | 1bb59632 |
14 | 11d41080 |
15 | a8228ec |
hex | 7287288 |
120091272 has 64 divisors (see below), whose sum is σ = 354201600. Its totient is φ = 33203520.
The previous prime is 120091261. The next prime is 120091273. The reversal of 120091272 is 272190021.
It is a super-2 number, since 2×1200912722 = 28843827221155968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (120091273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6322 + ... + 16737.
It is an arithmetic number, because the mean of its divisors is an integer number (5534400).
Almost surely, 2120091272 is an apocalyptic number.
120091272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120091272 is an abundant number, since it is smaller than the sum of its proper divisors (234110328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120091272 is a wasteful number, since it uses less digits than its factorization.
120091272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23106 (or 23102 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 24.
The square root of 120091272 is about 10958.6163360161. The cubic root of 120091272 is about 493.3674365679.
The spelling of 120091272 in words is "one hundred twenty million, ninety-one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •