Base | Representation |
---|---|
bin | 111110001011110001110… |
… | …111100101110101001001 |
3 | 120010112000111212222010020 |
4 | 332023301313211311021 |
5 | 1030003111333433103 |
6 | 13031034553011053 |
7 | 620506152236403 |
oct | 76136167456511 |
9 | 16115014788106 |
10 | 4273255374153 |
11 | 13a83062896a7 |
12 | 5902286b3a89 |
13 | 24cc73b1b33c |
14 | 10ab80517b73 |
15 | 7625572a753 |
hex | 3e2f1de5d49 |
4273255374153 has 16 divisors (see below), whose sum is σ = 6143833147200. Its totient is φ = 2633071345920.
The previous prime is 4273255374133. The next prime is 4273255374173. The reversal of 4273255374153 is 3514735523724.
It is an interprime number because it is at equal distance from previous prime (4273255374133) and next prime (4273255374173).
It is not a de Polignac number, because 4273255374153 - 214 = 4273255357769 is a prime.
It is a super-2 number, since 2×42732553741532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4273255374096 and 4273255374105.
It is not an unprimeable number, because it can be changed into a prime (4273255374133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 914258548 + ... + 914263221.
It is an arithmetic number, because the mean of its divisors is an integer number (383989571700).
Almost surely, 24273255374153 is an apocalyptic number.
It is an amenable number.
4273255374153 is a deficient number, since it is larger than the sum of its proper divisors (1870577773047).
4273255374153 is a wasteful number, since it uses less digits than its factorization.
4273255374153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1828521832.
The product of its digits is 10584000, while the sum is 51.
The spelling of 4273255374153 in words is "four trillion, two hundred seventy-three billion, two hundred fifty-five million, three hundred seventy-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •