Base | Representation |
---|---|
bin | 100101000100001000111001… |
… | …011111001011010010100011 |
3 | 210101011210212020102012011110 |
4 | 211010020321133023102203 |
5 | 132331242342211221103 |
6 | 1334410425510314403 |
7 | 46223145056230035 |
oct | 4504107137132243 |
9 | 711153766365143 |
10 | 163012153226403 |
11 | 47a3907a861918 |
12 | 16348a20358a03 |
13 | 6cc5c98347450 |
14 | 2c37b8a547c55 |
15 | 13ca4c0a02403 |
hex | 9442397cb4a3 |
163012153226403 has 32 divisors (see below), whose sum is σ = 234619447974912. Its totient is φ = 100079241120000.
The previous prime is 163012153226339. The next prime is 163012153226437. The reversal of 163012153226403 is 304622351210361.
It is not a de Polignac number, because 163012153226403 - 26 = 163012153226339 is a prime.
It is a super-3 number, since 3×1630121532264033 (a number of 44 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (163012153226203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 85588023 + ... + 87471903.
It is an arithmetic number, because the mean of its divisors is an integer number (7331857749216).
Almost surely, 2163012153226403 is an apocalyptic number.
163012153226403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
163012153226403 is a deficient number, since it is larger than the sum of its proper divisors (71607294748509).
163012153226403 is a wasteful number, since it uses less digits than its factorization.
163012153226403 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1889115.
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 163012153226403 in words is "one hundred sixty-three trillion, twelve billion, one hundred fifty-three million, two hundred twenty-six thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •