Base | Representation |
---|---|
bin | 10001011010001… |
… | …10100110111000 |
3 | 101011210122222000 |
4 | 20231012212320 |
5 | 244341310042 |
6 | 22254101000 |
7 | 3422221206 |
oct | 1055064670 |
9 | 334718860 |
10 | 146041272 |
11 | 75488a73 |
12 | 40aaa760 |
13 | 24344070 |
14 | 15578076 |
15 | cc4b74c |
hex | 8b469b8 |
146041272 has 64 divisors (see below), whose sum is σ = 436884000. Its totient is φ = 44934912.
The previous prime is 146041261. The next prime is 146041297. The reversal of 146041272 is 272140641.
146041272 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23197 + ... + 28812.
Almost surely, 2146041272 is an apocalyptic number.
146041272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
146041272 is an abundant number, since it is smaller than the sum of its proper divisors (290842728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146041272 is a wasteful number, since it uses less digits than its factorization.
146041272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52037 (or 52027 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 146041272 is about 12084.7537004277. The cubic root of 146041272 is about 526.6133553544.
It can be divided in two parts, 14604 and 1272, that added together give a square (15876 = 1262).
The spelling of 146041272 in words is "one hundred forty-six million, forty-one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •