Base | Representation |
---|---|
bin | 1000101001100101010… |
… | …0010011111000100001 |
3 | 112012120021020101002110 |
4 | 2022121110103320201 |
5 | 4413313342021213 |
6 | 152133313505533 |
7 | 13510321506444 |
oct | 2123124237041 |
9 | 465507211073 |
10 | 148601126433 |
11 | 580265097a1 |
12 | 249722722a9 |
13 | 11022806616 |
14 | 7299a9365b |
15 | 3ceadad5c3 |
hex | 2299513e21 |
148601126433 has 4 divisors (see below), whose sum is σ = 198134835248. Its totient is φ = 99067417620.
The previous prime is 148601126341. The next prime is 148601126447. The reversal of 148601126433 is 334621106841.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 148601126433 - 212 = 148601122337 is a prime.
It is a super-3 number, since 3×1486011264333 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 148601126391 and 148601126400.
It is not an unprimeable number, because it can be changed into a prime (148601126473) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24766854403 + ... + 24766854408.
It is an arithmetic number, because the mean of its divisors is an integer number (49533708812).
Almost surely, 2148601126433 is an apocalyptic number.
It is an amenable number.
148601126433 is a deficient number, since it is larger than the sum of its proper divisors (49533708815).
148601126433 is an equidigital number, since it uses as much as digits as its factorization.
148601126433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49533708814.
The product of its (nonzero) digits is 82944, while the sum is 39.
The spelling of 148601126433 in words is "one hundred forty-eight billion, six hundred one million, one hundred twenty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •