Base | Representation |
---|---|
bin | 100010001000011… |
… | …0101001110111011 |
3 | 2221211000101112110 |
4 | 1010100311032323 |
5 | 4321141404120 |
6 | 305350543403 |
7 | 40244401200 |
oct | 10420651673 |
9 | 2854011473 |
10 | 1145263035 |
11 | 538520084 |
12 | 27b667b63 |
13 | 15336ac47 |
14 | ac161ca7 |
15 | 6a8272e0 |
hex | 444353bb |
1145263035 has 96 divisors (see below), whose sum is σ = 2285632512. Its totient is φ = 486984960.
The previous prime is 1145263027. The next prime is 1145263037. The reversal of 1145263035 is 5303625411.
It is not a de Polignac number, because 1145263035 - 23 = 1145263027 is a prime.
It is a super-2 number, since 2×11452630352 = 2623254838674822450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145262993 and 1145263011.
It is not an unprimeable number, because it can be changed into a prime (1145263037) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 624570 + ... + 626400.
It is an arithmetic number, because the mean of its divisors is an integer number (23808672).
Almost surely, 21145263035 is an apocalyptic number.
1145263035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1145263035 is a deficient number, since it is larger than the sum of its proper divisors (1140369477).
1145263035 is a wasteful number, since it uses less digits than its factorization.
1145263035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1913 (or 1906 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 1145263035 is about 33841.7351062265. The cubic root of 1145263035 is about 1046.2490608340.
Adding to 1145263035 its reverse (5303625411), we get a palindrome (6448888446).
The spelling of 1145263035 in words is "one billion, one hundred forty-five million, two hundred sixty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •